Synchronous flow shop scheduling with pliable jobs
DOI10.1016/J.EJOR.2018.04.024zbMATH Open1403.90307OpenAlexW2799693042WikidataQ129949327 ScholiaQ129949327MaRDI QIDQ723997FDOQ723997
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
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
Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Title not available (Why is that?)
- Optimal two- and three-stage production schedules with set-up time included
- The Complexity of Flowshop and Jobshop Scheduling
- Scheduling with deadlines and loss functions
- Benchmarks for basic scheduling problems
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- Flow shop-sequencing problem with synchronous transfers and makespan minimization
- Complexity results for flow shop problems with synchronous movement
- Scheduling three-operation jobs in a two-machine flow shop to minimize makespan
- Solution algorithms for synchronous flow shop problems with two dominating machines
- Properties of optimal schedules in preemptive shop scheduling
- Open shop scheduling with synchronization
- Decomposition algorithms for synchronous flow shop problems with additional resources and setup times
- Integer preemptive scheduling on parallel machines
- Sequencing jobs on an automobile assembly line: objectives and procedures
- Sequencing and scheduling in flowshops with task redistribution
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)
