Total flowtime in no-wait flowshops with separated setup times.
From MaRDI portal
Publication:1406685
DOI10.1016/S0305-0548(98)00002-1zbMath1040.90523OpenAlexW1988343920MaRDI QIDQ1406685
Ali Allahverdi, Tariq A. Aldowaisan
Publication date: 7 September 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(98)00002-1
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (14)
A note on minimizing maximum lateness in a two-machine no-wait flowshop ⋮ Flow-shop scheduling for three serial stations with the last two duplicate ⋮ A novel timetabling algorithm for a furnace process for semiconductor fabrication with constrained waiting and frequency-based setups ⋮ New heuristics for no-wait flowshops to minimize makespan. ⋮ Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness ⋮ A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups ⋮ 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 ⋮ The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time ⋮ A new heuristic and dominance relations for no-wait flowshops with setups ⋮ No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan ⋮ Flowshop/no-idle scheduling to minimise the mean flowtime ⋮ COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM ⋮ Flowshop-scheduling problems with makespan criterion: a review
Cites Work
- Job lateness in a two-machine flowshop with setup times separated
- An efficient heuristic approach to the scheduling of jobs in a flowshop
- Two-machine group scheduling problem with blocking and anticipatory setups
- Scheduling in stochastic flowshops with independent setup, processing and removal times
- Job lateness in flowshops with setup and removal times separated
- Heuristic algorithms for continuous flow-shop problem
- Sequency on two and three machines with setup, processing and removal times separated
- Solvable Cases of the No-wait Flow-shop Scheduling Problem
- An Evaluation of Flow Shop Sequencing Heuristics
- Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
- Two-Stage Production Scheduling with Separated Set-up Times and Stochastic Breakdowns
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
This page was built for publication: Total flowtime in no-wait flowshops with separated setup times.
