Complexity of flow shop scheduling problems with transportation constraints
From MaRDI portal
Recommendations
- A note on the complexity of flow shop scheduling with transportation constraints
- Flowshop scheduling with interstage job transportation
- Machine scheduling with transportation considerations
- Complexity results for flow-shop and open-shop scheduling problems with transportation delays
- Complexity of problem \(TF2|v=1,c=2|C_{\max}\)
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3895002 (Why is no real title available?)
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Machine scheduling with transportation considerations
- Optimal two- and three-stage production schedules with set-up time included
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling batches with sequential job processing for two-machine flow and open shops
- Scheduling batches with simultaneous job processing for two-machine shop problems
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- Solvable Cases of the No-wait Flow-shop Scheduling Problem
- The Three-Machine No-Wait Flow Shop is NP-Complete
Cited in
(31)- Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration
- Complexity results for flow-shop and open-shop scheduling problems with transportation delays
- An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers
- A decentralized production–distribution scheduling problem: Solution and analysis
- scientific article; zbMATH DE number 6747350 (Why is no real title available?)
- Survey of research in the design and control of automated guided vehicle systems
- Transporting jobs through a two‐machine open shop
- An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
- Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time
- Machine scheduling with transportation considerations
- Ant colony algorithm for just-in-time job shop scheduling with transportation times and multirobots
- Using genetic algorithms for the coordinated scheduling problem of a batching machine and two-stage transportation
- Logistics scheduling with batching and transportation
- Flowshop scheduling with interstage job transportation
- Solving composite scheduling problems using the hybrid genetic algorithm
- An uncertain programming model for single machine scheduling problem with batch delivery
- Complexity of scheduling problem in single-machine flexible manufacturing system with cyclic transportation and unlimited buffers
- Two parallel machines problem with job delivery coordination and availability constraint
- Scenario analysis-based decision and coordination in supply chain management with production and transportation scheduling
- Complexity results for flow shop problems with synchronous movement
- Synchronizing production and air transportation scheduling using mathematical programming models
- Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited
- scientific article; zbMATH DE number 1374865 (Why is no real title available?)
- Complexity of flowshop scheduling problems with a new blocking constraint
- A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots
- Complexity of workforce scheduling in transfer lines
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- A new heuristic algorithm for the machine scheduling problem with job delivery coordination
- A note on the complexity of flow shop scheduling with transportation constraints
- Realistic two-stage flowshop batch scheduling problems with transportation capacity and times
- Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time
This page was built for publication: Complexity of flow shop scheduling problems with transportation constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1887768)
