Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds
From MaRDI portal
Publication:1804883
DOI10.1016/0166-218X(93)E0153-PzbMath0835.90114OpenAlexW2091541858MaRDI QIDQ1804883
Publication date: 17 May 1995
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(93)e0153-p
Related Items (7)
Mean flow time minimization with given bounds of processing times ⋮ Two-machine flowshop minimum-length scheduling problem with random and bounded processing times ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Optimal makespan scheduling with given bounds of processing times ⋮ Single machine scheduling with controllable release and processing parameters ⋮ A survey of scheduling problems with no-wait in process ⋮ A review of TSP based approaches for flowshop scheduling
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recognition of Gilmore-Gomory traveling salesman problem
- Two machine mixed shop scheduling problem with controllable machine speeds
- A note on the flow-shop problem without interruptions in job processing
- TWO MACHINE OPEN SHOP SCHEDULING PROBLEM WITH CONTROLLABLE MACHINE SPEEDS
- The Three-Machine No-Wait Flow Shop is NP-Complete
- Complexity of Scheduling Shops with No Wait in Process
- Flowshop scheduling with limited temporary storage
- Optimal flowshop schedules with no intermediate storage space
- An O(n log n) Algorithm for the Two-Machine Flow Shop Problem with Controllable Machine Speeds
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- On the Flow-Shop Sequencing Problem with No Wait in Process†
- Solution of the Flowshop-Scheduling Problem with No Intermediate Queues
This page was built for publication: Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds
