Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach

DOI10.1016/J.AMC.2006.01.068MaRDI QIDQ856080zbMATH OpenOpenAlexFDO

Authors Siew C. Teo, Mohamed Khaled Omar

Publication date 7 December 2006

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2006.01.068

zbMATH Keywords

incompatible familiesearliness--tardiness schedulingMIP formulation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Minimising earliness and tardiness on parallel machines with sequence-dependent setups
• Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system
• Multiple-machine scheduling with earliness, tardiness and completion time penalties
• Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization
• Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs

Cites work

• scientific article; zbMATH DE number 4059106 (Why is no real title available?)
• A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date
• Due window scheduling for parallel machines
• Due-date assignment and early/tardy scheduling on identical parallel machines
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
• Early/tardy scheduling with sequence dependent setups on uniform parallel machines
• Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs
• Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs
• Minimizing mean absolute deviation of completion times about a common due date
• Minimizing the average deviation of job completion times about a common due date
• Multicriteria scheduling problems: a survey
• Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
• Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
• Scheduling job families about an unrestricted common due date on a single machine
• Scheduling under a common due-date on parallel unrelated machines
• Scheduling with batch setup times and earliness-tardiness penalties
• Sequencing with Earliness and Tardiness Penalties: A Review
• Single machine weighted earliness-tardiness penalty problem with a common due date
• Single- and multiple-processor models for minimizing completion time variance
• Single-machine scheduling to minimize absolute deviation of completion times from a common due date
• Solving Parallel Machine Scheduling Problems by Column Generation
• The complexity of scheduling job families about a common due date
• The parallel machine min-max weighted absolute lateness scheduling problem
• The weighted common due date single machine scheduling problem revisited

Cited in

(8)

• Single machine scheduling with family setups to minimize total earliness and tardiness
• Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization
• Parallel machines scheduling with machine preference via agent-based approach
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
• A tabu search algorithm for a pipe-processing flowshop scheduling problem minimizing total tardiness in a shipyard
• An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach
• Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
• Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs

This page was built for publication: Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach

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