Earliness-tardiness scheduling with setup considerations

DOI10.1016/j.cor.2003.12.002zbMath1075.90032OpenAlexW2023838035MaRDI QIDQ1777159

Francis Sourd

Publication date: 12 May 2005

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

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

zbMATH Keywords

HeuristicsBranch-and-boundMIP formulationSetup timesEarliness-tardiness scheduling

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (18)

An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times ⋮ A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness ⋮ Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem ⋮ A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows ⋮ Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times ⋮ On the exact solution of a large class of parallel machine scheduling problems ⋮ Scheduling with returnable containers ⋮ A survey of scheduling problems with setup times or costs ⋮ Single machine scheduling with family setups to minimize total earliness and tardiness ⋮ The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times ⋮ Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints ⋮ Scheduling a single machine to minimize a regular objective function under setup constraints ⋮ A Meta-RaPS for the early/tardy single machine scheduling problem ⋮ Parallel machine scheduling with precedence constraints and setup times ⋮ A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties ⋮ Some dominance properties for single-machine tardiness problems with sequence-dependent setup ⋮ Integrated optimization of test case selection and sequencing for reliability testing of the mainboard of Internet backbone routers ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems

Uses Software

• CPLEX
• ILOG SCHEDULE

Cites Work

• Unnamed Item
• Scheduling with batch setup times and earliness-tardiness penalties
• A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem
• Early/tardy scheduling with sequence dependent setups on uniform parallel machines
• The complexity of scheduling job families about a common due date
• Using short-term memory to minimize the weighted number of late jobs on a single machine.
• Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
• PERT scheduling with convex cost functions.
• Single machine scheduling with symmetric earliness and tardiness penalties
• Tight LP bounds for resource constrained project scheduling
• A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time
• Algorithms for a class of single-machine weighted tardiness and earliness problems
• The one-machine problem with earliness and tardiness penalties
• Multicriteria scheduling problems: a survey
• The Continuous Assignment Problem and Its Application to Preemptive and Non-Preemptive Scheduling with Irregular Cost Functions
• Sequencing with Earliness and Tardiness Penalties: A Review
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• A genetic algorithm for scheduling job families on a single machine with arbitrary earliness/tardiness penalties and an unrestricted common due date
• Scheduling job families about an unrestricted common due date on a single machine
• Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
• A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time
• Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
• Single-machine scheduling with early and tardy completion costs
• Optimal timing schedules in earliness-tardiness single machine sequencing

This page was built for publication: Earliness-tardiness scheduling with setup considerations