Flow shop scheduling with flexible processing times

DOI10.1007/s00291-018-0520-8zbMath1405.90059OpenAlexW2801054551MaRDI QIDQ1621840

Stefan Waldherr, Sigrid Knust, Matthias Bultmann

Publication date: 12 November 2018

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-018-0520-8

zbMATH Keywords

schedulingflow shopflexible processing timesprocessing time redistribution

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)

Related Items

Exact solution of the two-machine flow shop problem with three operations, Shop scheduling problems with pliable jobs

Cites Work

• Scheduling three-operation jobs in a two-machine flow shop to minimize makespan
• Complexity results for flow shop problems with synchronous movement
• A survey of results for sequencing problems with controllable processing times
• A two-machine flow shop scheduling problem with controllable job processing times
• Open shop scheduling with synchronization
• Benchmarks for basic scheduling problems
• A survey of scheduling with controllable processing times
• Flowshop scheduling research after five decades
• Optimal two- and three-stage production schedules with setup times included
• The Three-Machine No-Wait Flow Shop is NP-Complete
• General flow-shop scheduling with resource constraints
• The Complexity of Flowshop and Jobshop Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• 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
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process