Decomposition algorithms for synchronous flow shop problems with additional resources and setup times

DOI10.1016/J.EJOR.2016.11.015MaRDI QIDQ1751897zbMATH OpenOpenAlexFDO

Authors Stefan Waldherr, Sigrid Knust

Publication date 25 May 2018

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

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

zbMATH Keywords

flow shopresourcesschedulingsetup timessynchronous movement

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Solution algorithms for synchronous flow shop problems with two dominating machines
• Flow shop-sequencing problem with synchronous transfers and makespan minimization
• Decomposition methods for reentrant flow shops with sequence-dependent setup times
• Decomposition approaches in permutation scheduling problems with application to the M-machine flow shop scheduling problems
• Synchronous flow shop scheduling with pliable jobs

Cites work

• A combinatorial property of Pallet-constrained two machine flow shop problem in minimizing makespan
• A survey of scheduling problems with setup times or costs
• Assembly line balancing in a mixed-model sequencing environment with synchronous transfers.
• Benchmarks for basic scheduling problems
• Complexity results for flow shop problems with synchronous movement
• Flow shop-sequencing problem with synchronous transfers and makespan minimization
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Minimizing makespan in a pallet-constrained flowshop
• Scheduling subject to resource constraints: Classification and complexity
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• Solution algorithms for synchronous flow shop problems with two dominating machines
• Some new results in flow shop scheduling

Cited in

(8)

• Decomposition methods for reentrant flow shops with sequence-dependent setup times
• A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems
• Production, maintenance and resource scheduling: a review
• Mathematical modelling and heuristic approaches to job-shop scheduling problem with conveyor-based continuous flow transporters
• Solution algorithms for synchronous flow shop problems with two dominating machines
• Flowshop with additional resources during setups: mathematical models and a GRASP algorithm
• A unified solution framework for flexible job shop scheduling problems with multiple resource constraints
• Synchronous flow shop scheduling with pliable jobs

This page was built for publication: Decomposition algorithms for synchronous flow shop problems with additional resources and setup times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1751897)