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

DOI10.1016/S0305-0548(97)00018-XMaRDI QIDQ1374028zbMATH OpenFDO

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)

zbMATH Keywords

makespantraveling salesmantwo-machine flow shopassembly problemno-wait in processtwo-stage processing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

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

Cites work

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

Cited in

(11)

• A survey of scheduling problems with no-wait in process
• 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

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)