Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling
Authors:
- Kathrin MaassenKMKathrin Maassen
- Paz Perez-GonzalezPPPaz Perez-Gonzalez
- Lisa C. GüntherLGLisa C. Günther
- 1 September 2020
- journal article
- research article
- Published by Elsevier in Computers & Operations Research
- Vol. 121
Abstract
No abstract availableKeywords
Funding Information
- Ministerio de Ciencia e Innovación
This publication has 63 references indexed in Scilit:
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtimeComputers & Operations Research, 2013
- Makespan and workstation utilization minimization in a flowshop with operations flexibilityOmega, 2011
- Single-machine scheduling to minimize total absolute differences in waiting times with deteriorating jobsJournal of the Operational Research Society, 2011
- Ant colony optimization for multi-objective flow shop scheduling problemComputers & Industrial Engineering, 2008
- Influencing factors of job waiting time variance on a single machineEuropean J. of Industrial Engineering, 2007
- A generalized two-machine flowshop scheduling problem with processing time linearly dependent on job waiting-timeComputers & Industrial Engineering, 1999
- Job‐shop scheduling to minimize total waiting timeApplied Stochastic Models and Data Analysis, 1993
- Heuristics for Flowshop Scheduling Problems Minimizing Mean TardinessJournal of the Operational Research Society, 1993
- Alternative Formulations of a Flow-shop Scheduling ProblemJournal of the Operational Research Society, 1989
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954