Minimizing the total completion time in a two-machine flowshop with sequence-independent setup times
- 1 April 2012
- journal article
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 63 (4) , 445-459
Abstract
Journal of the Operational Research Society (JORS) is the world's longest established OR journal and an official journal of The OR Society. It is the aim of the Journal to present papers which are relevant to practitioners, researchers, teachers, students and consumers of operational research, and which cover the theory, practice, history or methodology of OR.Keywords
This publication has 18 references indexed in Scilit:
- Polynomial Lower Bounds for the Two-Machine Flowshop Problem with Sequence-Independent Setup TimesElectronic Notes in Discrete Mathematics, 2010
- A win-win collaboration approach for a two-echelon supply chain: a case study in the pulp and paper industryEuropean J. of Industrial Engineering, 2010
- Multi-agent modelling for replenishment policies simulation in supply chainsEuropean J. of Industrial Engineering, 2010
- An empirical study on supply chain management in India: the perspective of original equipment manufacturers and suppliersEuropean J. of Industrial Engineering, 2010
- A survey of scheduling problems with setup times or costsEuropean Journal of Operational Research, 2008
- The significance of reducing setup times/setup costsEuropean Journal of Operational Research, 2008
- A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup timesEuropean Journal of Operational Research, 2006
- Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup timesComputers & Operations Research, 2000
- Genetic algorithms for flowshop scheduling problemsComputers & Industrial Engineering, 1996
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954