New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness

DOI10.1080/00207540802070942zbMath1198.90207OpenAlexW1989312204MaRDI QIDQ3055285

Rubén Ruiz, Ali Allahverdi

Publication date: 7 November 2010

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540802070942

zbMATH Keywords

heuristicsmodellingschedulingmetaheuristicsgenetic algorithmsmakespanflow shopflow shop schedulingflow linesmath programming

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Total completion time with makespan constraint in no-wait flowshops with setup times ⋮ A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness ⋮ No-wait flowshop scheduling problem with two criteria; total tardiness and makespan ⋮ A survey of scheduling problems with no-wait in process ⋮ Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion ⋮ No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan

Cites Work

• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• No-wait flowshops with bicriteria of makespan and maximum lateness.
• A decomposition algorithm for the single machine total tardiness problem
• The significance of reducing setup times/setup costs
• A survey of scheduling problems with setup times or costs
• An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
• A review of TSP based approaches for flowshop scheduling
• The Three-Machine No-Wait Flow Shop is NP-Complete
• Solutions to the Constrained Flowshop Sequencing Problem
• A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
• No-wait flowshops with bicriteria of makespan and total completion time
• Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated
• Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
• On the Flow-Shop Sequencing Problem with No Wait in Process^†
• Solution of the Flowshop-Scheduling Problem with No Intermediate Queues
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process