A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness

DOI10.1016/S0305-0548(02)00143-0zbMath1087.90025OpenAlexW2072884373MaRDI QIDQ1765532

Ali Allahverdi

Publication date: 23 February 2005

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

Full work available at URL: https://doi.org/10.1016/s0305-0548(02)00143-0

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35)

Related Items (11)

Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling ⋮ A multi-agent system for integrated scheduling and maintenance planning of the flexible job shop ⋮ Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem ⋮ A bicriteria flowshop scheduling with a learning effect ⋮ Scheduling at coal handling facilities using simulated annealing ⋮ Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness ⋮ Setting a common due date in a constrained flowshop: a variable neighbourhood search approach ⋮ A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs ⋮ Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm

Cites Work

• Unnamed Item
• Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge
• Minimizing total tardiness in permutation flowshops
• Multiple and bicriteria scheduling: A literature survey
• Job lateness in a two-machine flowshop with setup times separated
• An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
• A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan
• Tabu search for total tardiness minimization in flowshop scheduling problems
• A heuristic algorithm for mean flowtime objective in flowshop scheduling
• Heuristic procedures for minimizing makespan and the number of required pallets
• Note—Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution
• Two-Stage Production Scheduling with Separated Set-up Times and Stochastic Breakdowns
• Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness

This page was built for publication: A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness