Complexity of flow shop scheduling problems with transportation constraints
From MaRDI portal
Publication:1887768
DOI10.1016/j.ejor.2003.03.002zbMath1065.90043OpenAlexW1993634122MaRDI QIDQ1887768
Ameur Soukhal, Ammar Oulamara, Patrick Martineau
Publication date: 22 November 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2003.03.002
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Complexity and performance of numerical algorithms (65Y20)
Related Items
Solving composite scheduling problems using the hybrid genetic algorithm ⋮ Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots ⋮ Synchronizing production and air transportation scheduling using mathematical programming models ⋮ A note on the complexity of flow shop scheduling with transportation constraints ⋮ Ant colony algorithm for just-in-time job shop scheduling with transportation times and multirobots ⋮ Realistic two-stage flowshop batch scheduling problems with transportation capacity and times ⋮ A decentralized production–distribution scheduling problem: Solution and analysis ⋮ An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers ⋮ Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited ⋮ An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers ⋮ Logistics scheduling with batching and transportation ⋮ Using genetic algorithms for the coordinated scheduling problem of a batching machine and two-stage transportation ⋮ Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time ⋮ Transporting jobs through a two‐machine open shop ⋮ Scenario analysis-based decision and coordination in supply chain management with production and transportation scheduling ⋮ An uncertain programming model for single machine scheduling problem with batch delivery ⋮ A new heuristic algorithm for the machine scheduling problem with job delivery coordination ⋮ Survey of research in the design and control of automated guided vehicle systems ⋮ Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time ⋮ Two parallel machines problem with job delivery coordination and availability constraint
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal two- and three-stage production schedules with setup times included
- Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops
- The Three-Machine No-Wait Flow Shop is NP-Complete
- Solvable Cases of the No-wait Flow-shop Scheduling Problem
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- Machine scheduling with transportation considerations
- Scheduling batches with simultaneous job processing for two-machine shop problems
