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

DOI10.1016/J.COR.2007.09.013zbMath1163.90008OpenAlexW2046030366MaRDI QIDQ954048

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

flowtimehierarchical criteriaparallel machine schedulingtotal earliness and tardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints ⋮ A multi-objective optimization for preemptive identical parallel machines scheduling problem ⋮ Bicriteria multi-machine scheduling with equal processing times subject to release dates ⋮ An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach ⋮ A TABU SEARCH ALGORITHM FOR A PIPE-PROCESSING FLOWSHOP SCHEDULING PROBLEM MINIMIZING TOTAL TARDINESS IN A SHIPYARD

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling under a common due-date on parallel unrelated machines
• Minimizing makespan subject to minimum total flow-time on identical parallel machines
• Makespan minimization subject to flowtime optimality on identical parallel machines
• Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
• Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
• Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs
• Minimizing makespan subject to minimum flowtime on two identical parallel machines
• Parallel machine scheduling with a common due window

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