Integer Relaxation on Binary Quadratic Programming for Batching and Sequencing in Single Formulation to Minimize Total Actual Flow Times Criteria
DOI:
https://doi.org/10.21512/comtech.v2i2.2857Keywords:
actual flow time, batching, sequencing, simultaneous formulation, optimal solutionAbstract
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.
Plum Analytics
References
Halim, A. H., Toha, I. S., Zahedi. (1998). Simultaneous Resource Scheduling to Minimize Total Actual Flow Times. Proceeding of Pacific Congress of Manufacturing and Management. Victoria, Australia.
Zahedi. (2007). The Solution for Binary Quadratic Programming to Multiple Resources Scheduling Problem. Jurnal MatStat, 5 (1), September 2007. Jakarta: Binus University.
Zahedi. (2008). Integer Relaxation for Binary Quadratic Model in Batching and Scheduling with Minimize Total Actual Flow Times. Proceeding of National Conference in Mathematics, November 2008. Palembang, Indonesia.
Zahedi. (2008). Optimal Block Measurement Optimization to Minimize the Total Actual Flow Time. Jurnal MatStat, 6 (1), January 2008. Jakarta: Binus University.
Downloads
Published
Issue
Section
License
Authors who publish with this journal agree to the following terms:
a. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License - Share Alike that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
b. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
c. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
USER RIGHTS
All articles published Open Access will be immediately and permanently free for everyone to read and download. We are continuously working with our author communities to select the best choice of license options, currently being defined for this journal as follows:
