Two-stage no-wait scheduling models with setup and removal times separated

DOI10.1016/S0305-0548(97)00018-XzbMath0889.90086MaRDI QIDQ1374028

Jatinder N. D. Gupta, C. M. Zwaneveld, Vitaly A. Strusevich

Publication date: 22 June 1998

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

traveling salesmanmakespantwo-machine flow shopassembly problemno-wait in processtwo-stage processing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (11)

Two machine open shop scheduling problem with setup, processing and removal times separated ⋮ A novel timetabling algorithm for a furnace process for semiconductor fabrication with constrained waiting and frequency-based setups ⋮ Scheduling models for air traffic control in terminal areas ⋮ Some effective heuristics for no-wait flowshops with setup times to minimize total completion time ⋮ A survey of scheduling problems with no-wait in process ⋮ A new heuristic and dominance relations for no-wait flowshops with setups ⋮ Uma propriedade estrutural do problema de programação da produção flow shop permutacional com tempos de setup ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups ⋮ A heuristic for the two-machine open-shop scheduling problem with transportation times ⋮ A review of TSP based approaches for flowshop scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• The two-machine sequence dependent flowshop scheduling problem
• Scheduling a two-stage hybrid flowshop with separable setup and removal times
• Two machine open shop scheduling problem with setup, processing and removal times separated
• Optimal two- and three-stage production schedules with setup times included
• FLOWSHOP SCHEDULES WITH SEQUENCE DEPENDENT SETUP TIMES
• Sequency on two and three machines with setup, processing and removal times separated
• The Three-Machine No-Wait Flow Shop is NP-Complete
• Complexity of Scheduling Shops with No Wait in Process
• Open Shop Scheduling to Minimize Finish Time
• Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
• On non-permutation solutions to some two machine flow shop scheduling problems
• Sequencing n jobs on two machines with setup, processing and removal times separated
• The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem

This page was built for publication: Two-stage no-wait scheduling models with setup and removal times separated