Solving multi-criteria scheduling flow shop problem through compromise programming and satisfaction functions
The multi-criteria scheduling problem is one of the main research subjects in the field of multiple objectives programming. Several procedures have been developed to deal with this type of problem where some conflicting criteria have to be optimized simultaneously. The aim of our paper is to propose an aggregation procedure that integrates three different criteria to find the best sequence in a flow shop production environment. The compromise programming model and the concept of satisfaction functions will be utilized to integrate explicitly the manager's preferences according to the deviations between the achievement and the aspiration levels of the following criteria: Makespan, total flow time and total tardiness.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Van Wassenhove, Luc N. & Gelders, Ludo F., 1980. "Solving a bicriterion scheduling problem," European Journal of Operational Research, Elsevier, vol. 4(1), pages 42-48, January.
- Herbert G. Campbell & Richard A. Dudek & Milton L. Smith, 1970. "A Heuristic Algorithm for the n Job, m Machine Sequencing Problem," Management Science, INFORMS, vol. 16(10), pages B630-B637, June.
- Gupta, Jatinder N. D. & Neppalli, Venkata R. & Werner, Frank, 2001. "Minimizing total flow time in a two-machine flowshop problem with minimum makespan," International Journal of Production Economics, Elsevier, vol. 69(3), pages 323-338, February.
- Loukil, T. & Teghem, J. & Tuyttens, D., 2005. "Solving multi-objective production scheduling problems using metaheuristics," European Journal of Operational Research, Elsevier, vol. 161(1), pages 42-61, February.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:192:y:2009:i:2:p:460-467. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.