INTEGER RELAXATION ON BINARY QUADRATIC PROGRAMMING FOR BATCHING AND SEQUENCING IN SINGLE FORMULATION TO MINIMIZE TOTAL ACTUAL FLOW TIMES CRITERIA

Zahedi, Zahedi (2011) INTEGER RELAXATION ON BINARY QUADRATIC PROGRAMMING FOR BATCHING AND SEQUENCING IN SINGLE FORMULATION TO MINIMIZE TOTAL ACTUAL FLOW TIMES CRITERIA. Jurnal ComTech, 02 (02). ISSN 2087-1244

[img]
Preview
Text
48 MT_ZAHEDI-INTEGER RELAXATION ON BINARY QUADRATIC PROGRAMMING-Ok-ABSTRACT.pdf

Download (21kB) | Preview
Official URL: http://library.binus.ac.id/Collections/journal_det...

Abstract

This paper examines batch scheduling problem that has batching and sequencing in single formulation for multiple-item case. The first step is to develop a model for single item single resource discussed in Zahedi (2008). The model determined batch sizes and their schedule simultaneously in single item case. This paper develops the model and algorithm for multiple-item case. The model functions to minimize total actual flow times. An algorithm for the model is developed using a relaxation of the binary constraints. The binary values for the decision variables are obtained from steps provided in algorithm. A numerical experience showing characteristics of this problem is presented.

Item Type: Article
Additional Information: 8_Volume 02 / Nomor 02 / December 2011_INTEGER RELAXATION ON BINARY QUADRATIC PROGRAMMING FOR BATCHING AND SEQUENCING IN SINGLE FORMULATION TO MINIMIZE TOTAL ACTUAL FLOW TIMES CRITERIA
Subjects: Computer Science
Divisions: ?? journal_32_8_Volume-02-Nomor-02-December-2011 ??
Depositing User: Mr. Super Admin
Date Deposited: 10 Apr 2013 14:33
Last Modified: 11 Apr 2013 09:16
URI: http://eprints2.binus.ac.id/id/eprint/25447

Actions (login required)

View Item View Item