Synchronous flow shop scheduling with pliable jobs

DOI10.1016/J.EJOR.2018.04.024MaRDI QIDQ723997zbMATH OpenOpenAlexWikidataFDO

Authors Matthias Bultmann, Sigrid Knust, Stefan Waldherr

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

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

Recommendations

• Shop scheduling problems with pliable jobs
• Flow shop scheduling with flexible processing times
• A two-machine flow shop scheduling problem with controllable job processing times
• The two-machine permutation flow shop with state-dependent processing times
• A variant of the permutation flow shop model with variable processing times

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Benchmarks for basic scheduling problems
• Complexity results for flow shop problems with synchronous movement
• Decomposition algorithms for synchronous flow shop problems with additional resources and setup times
• Flow shop-sequencing problem with synchronous transfers and makespan minimization
• Integer preemptive scheduling on parallel machines
• Open shop scheduling with synchronization
• Optimal two- and three-stage production schedules with set-up time included
• Properties of optimal schedules in preemptive shop scheduling
• Scheduling three-operation jobs in a two-machine flow shop to minimize makespan
• Scheduling with deadlines and loss functions
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• Sequencing and scheduling in flowshops with task redistribution
• Sequencing jobs on an automobile assembly line: objectives and procedures
• Solution algorithms for synchronous flow shop problems with two dominating machines
• The Complexity of Flowshop and Jobshop Scheduling

Cited in

(5)

• Flow shop scheduling with flexible processing times
• Shop scheduling problems with pliable jobs
• Decomposition algorithms for synchronous flow shop problems with additional resources and setup times
• Analysis of reactive deadlock-free scheduling in flexible job shops
• A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems

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

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