Flowshop scheduling with sequence dependent setup times and batch delivery in supply chain
Authors:
- Humyun Fuad RahmanHRHumyun Fuad Rahman
- Mukund Nilakantan JanardhananMJMukund Nilakantan Janardhanan
- Liam Poon ChuenLCLiam Poon Chuen
- S.G. PonnambalamSPS.G. Ponnambalam
- 1 August 2021
- journal article
- research article
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 158
Abstract
No abstract availableKeywords
This publication has 54 references indexed in Scilit:
- Levy Flight Algorithm for Optimization Problems - A Literature ReviewApplied Mechanics and Materials, 2013
- A genetic algorithm for minimizing total tardiness/earliness of weighted jobs in a batched delivery systemComputers & Industrial Engineering, 2012
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithmComputers & Operations Research, 2009
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibilityEuropean Journal of Operational Research, 2006
- Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristicsEuropean Journal of Operational Research, 2005
- Scheduling with generalized batch delivery dates and earliness penaltiesIIE Transactions, 2000
- No free lunch theorems for optimizationIEEE Transactions on Evolutionary Computation, 1997
- A Mixed-Integer Goal-Programming Formulation of the Standard Flow-Shop Scheduling ProblemJournal of the Operational Research Society, 1986
- Minimizing the Sum of Completion Times of n Jobs over m Machines in a Flowshop—A Branch and Bound ApproachA I I E Transactions, 1977
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954