Makespan minimization for flow-shop problems with transportation times and a single robot
From MaRDI portal
Publication:5946823
DOI10.1016/S0166-218X(00)00316-4zbMath0990.90041MaRDI QIDQ5946823
Sigrid Knust, Johann L. Hurink
Publication date: 16 October 2001
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Production models (90B30)
Related Items (29)
Machine scheduling with job delivery coordination ⋮ Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration ⋮ A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots ⋮ Scheduling in reentrant robotic cells: algorithms and complexity ⋮ Two machine scheduling under disruptions with transportation considerations ⋮ Complexity of problem \(TF2|v=1,c=2|C_{\max}\) ⋮ Flowshop scheduling with interstage job transportation ⋮ Scheduling multi-staged jobs on parallel identical machines and a central server with sequence-dependent setup times: an application to an automated kitchen ⋮ Coordinating multi-location production and customer delivery ⋮ Flow shop scheduling problems with transportation constraints revisited ⋮ Flow shop scheduling problems with transportation constraints revisited ⋮ Preemptive scheduling on two identical parallel machines with a single transporter ⋮ A two-stage flow shop scheduling problem with transportation considerations ⋮ An improved approximation algorithm for a scheduling problem with transporter coordination ⋮ New complexity results on scheduling problem in a robotic cell ⋮ Complexity results for an integrated single machine scheduling and outbound delivery problem with fixed sequence ⋮ Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited ⋮ Multiplicity and complexity issues in contemporary production scheduling ⋮ Robotic cell scheduling with operational flexibility ⋮ Tabu search algorithms for job-shop problems with a single transport robot ⋮ Optimization of processing and delivery decisions involving third-party machines ⋮ Coordination of production and transportation in supply chain scheduling ⋮ Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times ⋮ Transporting jobs through a two‐machine open shop ⋮ An optimization-based heuristic for the robotic cell problem ⋮ A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\) ⋮ A framework for the complexity of high-multiplicity scheduling problems ⋮ Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time ⋮ On scheduling cycle shops: Classification, complexity and approximation
Cites Work
- Cyclic scheduling in robotic flowshops
- Scheduling a two-machine robotic cell: A solvable case
- Sequencing n Jobs on Two Machines with Arbitrary Time Lags
- Optimal two- and three-stage production schedules with setup times included
- Scheduling of a Two-machine Flowshop with Travel Time Between Machines
- Scheduling Parts in a Combined Production-transportation Work Cell
- ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER
- The Complexity of Flowshop and Jobshop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling in Robotic Cells: Classification, Two and Three Machine Cells
- Cyclic Scheduling of Identical Parts in a Robotic Cell
- Unnamed Item
- Unnamed Item
This page was built for publication: Makespan minimization for flow-shop problems with transportation times and a single robot
