Synchronous flow shop scheduling with pliable jobs

DOI10.1016/J.EJOR.2018.04.024zbMath1403.90307OpenAlexW2799693042WikidataQ129949327 ScholiaQ129949327MaRDI QIDQ723997

Stefan Waldherr, Sigrid Knust, Matthias Bultmann

Publication date: 25 July 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.2018.04.024

zbMATH Keywords

schedulingflow shopsynchronous movementpliability

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems ⋮ Shop scheduling problems with pliable jobs

Cites Work

• Unnamed Item
• Solution algorithms for synchronous flow shop problems with two dominating machines
• Scheduling three-operation jobs in a two-machine flow shop to minimize makespan
• Properties of optimal schedules in preemptive shop scheduling
• Complexity results for flow shop problems with synchronous movement
• Open shop scheduling with synchronization
• Decomposition algorithms for synchronous flow shop problems with additional resources and setup times
• Integer preemptive scheduling on parallel machines
• Benchmarks for basic scheduling problems
• Scheduling with Deadlines and Loss Functions
• Optimal two- and three-stage production schedules with setup times included
• The Complexity of Flowshop and Jobshop Scheduling
• Sequencing jobs on an automobile assembly line: objectives and procedures
• Sequencing and scheduling in flowshops with task redistribution
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• Flow shop-sequencing problem with synchronous transfers and makespan minimization

This page was built for publication: Synchronous flow shop scheduling with pliable jobs