Journal article
A Mixed-Integer Goal-Programming Formulation of the Standard Flow-Shop Scheduling Problem
Journal of the Operational Research Society, Vol.37(12), pp.1121-1128
1986
Abstract
This paper presents an extension of an earlier model developed by the authors, formulating the generalized N job, M machine standard flow-shop problem as a mixed-integer goal-programming model. The formulation was empirically tested through a comparison of the generated optimal solutions to their mathematically derived counterparts. For this, a special flow-shop problem with certain permutation properties was selected. In addition, a randomly chosen problem was solved to show the general applicability of the derived formulation. The model allows the incorporation of the makespan as well as the mean flow-time criteria, instead of optimization being based on a single objective.
Details
- Title
- A Mixed-Integer Goal-Programming Formulation of the Standard Flow-Shop Scheduling Problem
- Authors
- Willem Selen (Author) - University of Petroleum and Minerals, Saudi ArabiaD D Hott (Author) - University of North Carolina, United States
- Publication details
- Journal of the Operational Research Society, Vol.37(12), pp.1121-1128
- Publisher
- Palgrave MacMillan Ltd.
- Date published
- 1986
- DOI
- 10.1057/jors.1986.197
- ISSN
- 0160-5682
- Organisation Unit
- University of the Sunshine Coast, Queensland
- Language
- English
- Record Identifier
- 99448795102621
- Output Type
- Journal article
Metrics
2 File views/ downloads
1061 Record Views
InCites Highlights
These are selected metrics from InCites Benchmarking & Analytics tool, related to this output
- Collaboration types
- Domestic collaboration
- International collaboration
- Web Of Science research areas
- Management
- Operations Research & Management Science
UN Sustainable Development Goals (SDGs)
This output has contributed to the advancement of the following goals:
Source: InCites