Heuristics for no-wait flowshops with makespan subject to mean completion time

DOI10.1016/j.amc.2012.06.024zbMath1291.90089OpenAlexW2030347657MaRDI QIDQ2249033

Harun Aydilek, Ali Allahverdi

Publication date: 27 June 2014

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2012.06.024

zbMATH Keywords

schedulingmakespanheuristicno-wait flowshopMean completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (8)

Total completion time with makespan constraint in no-wait flowshops with setup times ⋮ A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach ⋮ Algorithms to minimize total completion time in a two-machine flowshop problem with uncertain set-up times ⋮ An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time ⋮ Intelligent optimization under the makespan constraint: rapid evaluation mechanisms based on the critical machine for the distributed flowshop group scheduling problem ⋮ No-wait flowshop scheduling problem with two criteria; total tardiness and makespan ⋮ A survey of scheduling problems with no-wait in process ⋮ No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan

Cites Work

• Complete local search with limited memory algorithm for no-wait job shops to minimize makespan
• Solving the continuous flow-shop scheduling problem by metaheuristics.
• New heuristics for no-wait flowshops to minimize makespan.
• Approximative procedures for no-wait job shop scheduling.
• Some local search algorithms for no-wait flow-shop problem with makespan criterion
• A survey of scheduling problems with setup times or costs
• A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
• Heuristic algorithms for continuous flow-shop problem
• Simulation-based metamodels for scheduling a dynamic job shop with sequence-dependent setup times
• Generating Experimental Data for Computational Testing with Machine Scheduling Applications
• 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
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process

This page was built for publication: Heuristics for no-wait flowshops with makespan subject to mean completion time