Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates
DOI10.1016/J.COR.2010.09.020zbMATH Open1202.90138OpenAlexW2044579086MaRDI QIDQ614053FDOQ614053
Authors: Shih-Wei Lin, Zne-Jung Lee, Kuo-Ching Ying, Chung-Cheng Lu 
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
Recommendations
- Heuristic scheduling of parallel machines with sequence-dependent set-up times
- Minimising earliness and tardiness on parallel machines with sequence-dependent setups
- An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem
- Scheduling jobs on parallel machines with sequence-dependent setup times
- Tabu Search Heuristics for Parallel Machine Scheduling with Sequence-Dependent Setup and Ready Times
maximum latenesssequence-dependent setup timesiterated greedy heuristicparallel machines scheduling problems
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A survey of scheduling problems with setup times or costs
- Title not available (Why is that?)
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- NP-complete scheduling problems
- Note: A local-search heuristic for large set-covering problems
- A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time
- An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks
- Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times
Cited In (14)
- Iterated greedy for the maximum diversity problem
- A two-stage solution approach for plastic injection machines scheduling problem
- MIP models and a matheuristic algorithm for an identical parallel machine scheduling problem under multiple copies of shared resources constraints
- Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness
- Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints
- ABC-based manufacturing scheduling for unrelated parallel machines with machine-dependent and job sequence-dependent setup times
- Minimization of maximum lateness on parallel machines with a single server and job release dates
- A simulation-based differential evolution algorithm for stochastic parallel machine scheduling with operational considerations
- An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
- Minimizing shifts for personnel task scheduling problems: a three-phase algorithm
- A three-stage optimization algorithm for the stochastic parallel machine scheduling problem with adjustable production rates
- Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
- Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints
- Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time
This page was built for publication: Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q614053)
