On no-wait and no-idle flow shops with makespan criterion

DOI10.1016/j.ejor.2006.01.036zbMath1163.90493OpenAlexW2030385822MaRDI QIDQ859679

Jerzy Kamburowski, Pawel Jan Kalczynski

Publication date: 16 January 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.01.036

zbMATH Keywords

schedulingmakespanflow shopsno-idle conditionno-wait condition

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (17)

Processing element allocation and dynamic scheduling codesign for multi-function SoCs ⋮ A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem ⋮ Applications of max-plus algebra to flow shop scheduling problems ⋮ Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling ⋮ No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines ⋮ Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion ⋮ A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness ⋮ A survey of scheduling problems with no-wait in process ⋮ A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion ⋮ Analysis of flow shop scheduling anomalies ⋮ A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion ⋮ Single-machine online scheduling of jobs with non-delayed processing constraint ⋮ Minimizing makespan for a no-wait flowshop using genetic algorithm ⋮ The evolution of schematic representations of flow shop scheduling problems ⋮ Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines ⋮ No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths ⋮ Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion

Cites Work

• Unnamed Item
• No-wait flowshops with bicriteria of makespan and maximum lateness.
• Some local search algorithms for no-wait flow-shop problem with makespan criterion
• Simple algorithms for gilmore-gomory's traveling salesman and related problems
• Optimal two- and three-stage production schedules with setup times included
• A concise survey of efficiently solvable special cases of the permutation flow-shop problem
• The Three-Machine No-Wait Flow Shop is NP-Complete
• The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)
• Optimal Two-Machine Orderings in the 3 × n Flow-Shop Problem
• Minimizing Cycle Time in a Blocking Flowshop
• Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• On the Flow-Shop Sequencing Problem with No Wait in Process^†
• Solution of the Flowshop-Scheduling Problem with No Intermediate Queues
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process

This page was built for publication: On no-wait and no-idle flow shops with makespan criterion