Minimising earliness and tardiness on parallel machines with sequence-dependent setups

DOI10.1504/IJOR.2010.033103zbMATH Open1188.90102OpenAlexW2109947313MaRDI QIDQ973440FDOQ973440

Authors: Ghazi M. Magableh, Scott J. Mason 

Publication date: 31 May 2010

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

Full work available at URL: https://doi.org/10.1504/ijor.2010.033103

Recommendations

• Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization
• Tabu Search Heuristics for Parallel Machine Scheduling with Sequence-Dependent Setup and Ready Times
• Early/tardy scheduling with sequence dependent setups on uniform parallel machines
• Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics
• Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times

zbMATH Keywords

due datesparallel machinestardinessparallel machine schedulingsequence-dependent setupsdispatching rulesearliness

Mathematics Subject Classification ID

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

Cited In (10)

• Single machine scheduling with family setups to minimize total earliness and tardiness
• Tabu Search Heuristics for Parallel Machine Scheduling with Sequence-Dependent Setup and Ready Times
• Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach
• Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates
• Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
• Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics
• A moving block heuristic to minimise earliness and tardiness costs on parallel machines
• Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times
• Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization
• Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times

This page was built for publication: Minimising earliness and tardiness on parallel machines with sequence-dependent setups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q973440)