Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates

DOI10.1016/j.cor.2010.09.020zbMath1202.90138OpenAlexW2044579086MaRDI QIDQ614053

Kuo-Ching Ying, Zne-Jung Lee, Chung-Cheng Lu, Shih-Wei Lin

Publication date: 23 December 2010

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

Full work available at URL: https://doi.org/10.1016/j.cor.2010.09.020

zbMATH Keywords

sequence-dependent setup timesmaximum latenessiterated greedy heuristicparallel machines scheduling problems

Mathematics Subject Classification ID

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

Related Items (9)

An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem ⋮ ABC-based manufacturing scheduling for unrelated parallel machines with machine-dependent and job sequence-dependent setup times ⋮ MIP models and a matheuristic algorithm for an identical parallel machine scheduling problem under multiple copies of shared resources constraints ⋮ A three-stage optimization algorithm for the stochastic parallel machine scheduling problem with adjustable production rates ⋮ A two-stage solution approach for plastic injection machines scheduling problem ⋮ A simulation‐based differential evolution algorithm for stochastic parallel machine scheduling with operational considerations ⋮ Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem ⋮ Iterated greedy for the maximum diversity problem ⋮ Minimizing shifts for personnel task scheduling problems: a three-phase algorithm

Cites Work

• Unnamed Item
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• NP-complete scheduling problems
• A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time
• 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
• An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times
• Note: A local-search heuristic for large set-covering problems

This page was built for publication: Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates