Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling
From MaRDI portal
Publication:2664303
DOI10.1016/j.cor.2020.104965zbMath1458.90328OpenAlexW3023786878MaRDI QIDQ2664303
Lisa C. Günther, Paz Perez-Gonzalez, Kathrin Maassen
Publication date: 20 April 2021
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2020.104965
Related Items
\(N\)-NEH+ algorithm for solving permutation flow shop problems ⋮ A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach ⋮ Improved NEH-based heuristic for the blocking flow-shop problem with bicriteria of the makespan and machine utilization ⋮ An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem ⋮ Scheduling for a flow shop with waiting time constraints and missing operations in semiconductor manufacturing
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
- NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- On no-wait and no-idle flow shops with makespan criterion
- Job scheduling methods for reducing waiting time variance
- A discrete version of particle swarm optimization for flowshop scheduling problems
- Some efficient heuristic methods for the flow shop sequencing problem
- Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
- Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times
- The flow shop problem with no-idle constraints: a review and approximation
- An efficient heuristic approach to the scheduling of jobs in a flowshop
- Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems
- Flowshop scheduling with dominant machines
- Three-machine flow shop scheduling with overlapping waiting time constraints
- A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
- Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection
- A survey of scheduling problems with no-wait in process
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- A comprehensive review and evaluation of permutation flowshop heuristics
- No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths
- Multi-machine scheduling with general position-based deterioration to minimize total load revisited
- Comparison of heuristics for flowtime minimisation in permutation flowshops
- Optimal two- and three-stage production schedules with setup times included
- Single-machine scheduling to minimize total absolute differences in waiting times with deteriorating jobs
- Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
- Minimising Waiting Time Variance in the Single Machine Problem
- The Complexity of Flowshop and Jobshop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Comparative evaluation of MILP flowshop models
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
- Minimizing a Quadratic Cost Function of Waiting Times in Single-Machine Scheduling
- Variance Minimization – Relationship between Completion-Time Variance and Waiting-Time Variance
- Permutation, no-wait, no-idle flow shop problems
- Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
- A note on parallel-machine scheduling with deteriorating jobs
- Flowshop-scheduling problems with makespan criterion: a review
- Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines
- Variance Minimization in Single Machine Sequencing Problems
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- Multi-Machine Scheduling With Linear Deterioration
- Scheduling
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
- Minimizing the total waiting time of intermediate products in a manufacturing process
