Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system

DOI10.1016/J.COR.2007.09.013MaRDI QIDQ954048zbMATHOpenAlexFDO

Authors Ling-Huey Su

Publication date 7 November 2008

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

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

zbMATH Keywords

parallel machine schedulingflowtimetotal earliness and tardinesshierarchical criteria

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling on parallel identical machines to minimize total tardiness
• Minimizing maximum earliness on parallel identical machines
• Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
• Due-date assignment and early/tardy scheduling on identical parallel machines
• Minimizing makespan subject to minimum total flow-time on identical parallel machines

Cites work

• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• scientific article; zbMATH DE number 849179 (Why is no real title available?)
• Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs
• Makespan minimization subject to flowtime optimality on identical parallel machines
• Minimizing makespan subject to minimum flowtime on two identical parallel machines
• Minimizing makespan subject to minimum total flow-time on identical parallel machines
• Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
• Parallel machine scheduling with a common due window
• Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
• Scheduling under a common due-date on parallel unrelated machines

Cited in

(12)

• Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach
• A tabu search algorithm for a pipe-processing flowshop scheduling problem minimizing total tardiness in a shipyard
• Optimal policies for minimizing total job completion times and deviations from common due dates in unrelated parallel machine scheduling
• Bicriteria multi-machine scheduling with equal processing times subject to release dates
• Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints
• Scheduling with earliness-tardiness penalties and parallel machines
• A mixed integer linear formulation for the open shop earliness-tardiness scheduling problem
• A moving block heuristic to minimise earliness and tardiness costs on parallel machines
• Minimizing the sum of job earliness and tardiness in a multimachine system
• An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach
• Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
• A multi-objective optimization for preemptive identical parallel machines scheduling problem

This page was built for publication: Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system

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