Two-stage no-wait scheduling models with setup and removal times separated
From MaRDI portal
Publication:1374028
DOI10.1016/S0305-0548(97)00018-XzbMATH Open0889.90086MaRDI QIDQ1374028FDOQ1374028
Authors: Jatinder N. D. Gupta, C. M. Zwaneveld, V. A. Strusevich 
Publication date: 22 June 1998
Published in: Computers \& Operations Research (Search for Journal in Brave)
Recommendations
- Scheduling a two-stage hybrid flowshop with separable setup and removal times
- Two-Stage Production Scheduling with Separated Set-up Times and Stochastic Breakdowns
- Scheduling in stochastic flowshops with independent setup, processing and removal times
- Two-machine mixed shop problem with setup, processing and removal time separated
- Scheduling for two-stage production system with setup and assembly operations
- Two machine open shop scheduling problem with setup, processing and removal times separated
- scientific article; zbMATH DE number 613300
- A two-stage model queueing with no waiting line between channels
makespantraveling salesmantwo-machine flow shopassembly problemno-wait in processtwo-stage processing
Cites Work
- Optimal two- and three-stage production schedules with set-up time included
- Title not available (Why is that?)
- Title not available (Why is that?)
- Open Shop Scheduling to Minimize Finish Time
- Complexity of Scheduling Shops with No Wait in Process
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- The two-machine sequence dependent flowshop scheduling problem
- FLOWSHOP SCHEDULES WITH SEQUENCE DEPENDENT SETUP TIMES
- Scheduling a two-stage hybrid flowshop with separable setup and removal times
- Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
- The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
- The Three-Machine No-Wait Flow Shop is NP-Complete
- Sequency on two and three machines with setup, processing and removal times separated
- Sequencing n jobs on two machines with setup, processing and removal times separated
- On non-permutation solutions to some two machine flow shop scheduling problems
- Two machine open shop scheduling problem with setup, processing and removal times separated
Cited In (11)
- A new heuristic and dominance relations for no-wait flowshops with setups
- A novel timetabling algorithm for a furnace process for semiconductor fabrication with constrained waiting and frequency-based setups
- Uma propriedade estrutural do problema de programação da produção flow shop permutacional com tempos de setup
- A review of TSP based approaches for flowshop scheduling
- Flowshop-scheduling problems with makespan criterion: a review
- A heuristic for the two-machine open-shop scheduling problem with transportation times
- Scheduling models for air traffic control in terminal areas
- Two machine open shop scheduling problem with setup, processing and removal times separated
- Some effective heuristics for no-wait flowshops with setup times to minimize total completion time
- A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups
- A survey of scheduling problems with no-wait in process
This page was built for publication: Two-stage no-wait scheduling models with setup and removal times separated
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1374028)
