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.068zbMath1119.68038OpenAlexW2005665367MaRDI QIDQ856080

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)

Related Items (7)

Parallel machines scheduling with machine preference via agent-based approach ⋮ Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization ⋮ 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 ⋮ A TABU SEARCH ALGORITHM FOR A PIPE-PROCESSING FLOWSHOP SCHEDULING PROBLEM MINIMIZING TOTAL TARDINESS IN A SHIPYARD ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems

Cites Work

• Unnamed Item
• Scheduling with batch setup times and earliness-tardiness penalties
• A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date
• Scheduling under a common due-date on parallel unrelated machines
• Early/tardy scheduling with sequence dependent setups on uniform parallel machines
• Due window scheduling for parallel machines
• The complexity of scheduling job families about a common due date
• The weighted common due date single machine scheduling problem revisited
• Multicriteria scheduling problems: a survey
• Minimizing the average deviation of job completion times about a common due date
• Sequencing with Earliness and Tardiness Penalties: A Review
• Minimizing mean absolute deviation of completion times about 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
• 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
• Scheduling job families about an unrestricted common due date on a single machine
• Due-date assignment and early/tardy scheduling on identical parallel machines
• The parallel machine min-max weighted absolute lateness scheduling problem
• Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
• Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs
• Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs
• Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
• Solving Parallel Machine Scheduling Problems by Column Generation
• Single machine weighted earliness-tardiness penalty problem with a common due date

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