A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
From MaRDI portal
Publication:835579
DOI10.1007/s10951-007-0048-2zbMath1168.90471OpenAlexW2047685618MaRDI QIDQ835579
Francis Sourd, Safia Kedad-Sidhoum
Publication date: 28 August 2009
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-007-0048-2
Related Items (25)
A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties ⋮ Fast neighborhood search for the single machine earliness-tardiness scheduling problem ⋮ Optimal restricted due date assignment in scheduling ⋮ Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties ⋮ An exact algorithm for the bi-objective timing problem ⋮ Improving schedule stability in single-machine rescheduling for new operation insertion ⋮ Minimizing total earliness and tardiness on a single machine using a hybrid heuristic ⋮ Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems ⋮ Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models ⋮ An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem ⋮ On the exact solution of a large class of parallel machine scheduling problems ⋮ Integrated production and delivery scheduling for multi-factory supply chain with stage-dependent inventory holding cost ⋮ Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders ⋮ Scheduling with returnable containers ⋮ Scheduling with time-dependent discrepancy times ⋮ A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time ⋮ On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation ⋮ \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees ⋮ A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties ⋮ The one-machine just-in-time scheduling problem with preemption ⋮ A new model for the preemptive earliness-tardiness scheduling problem ⋮ 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 ⋮ Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates ⋮ Time-indexed formulations for scheduling chains on a single machine: an application to airborne radars
Cites Work
- Unnamed Item
- Unnamed Item
- Preemption in single machine earliness/tardiness scheduling
- An algorithm for single machine sequencing with deadlines to minimize total weighted completion time
- A time indexed formulation of non-preemptive single machine scheduling problems
- A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
- Scheduling identical parallel machines to minimize total weighted completion time
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey
- Optimal timing of a sequence of tasks with general completion costs
- An exact approach to early/tardy scheduling with release dates
- Using short-term memory to minimize the weighted number of late jobs on a single machine.
- Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
- Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
- Machine scheduling with earliness, tardiness and non-execution penalties
- A branch and bound approach for single machine scheduling with earliness and tardiness penalties
- The one-machine problem with earliness and tardiness penalties
- Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
- A recovering beam search algorithm for the single machine just-in-time scheduling problem
- Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem
- A branch and bound procedure to minimize mean absolute lateness on a single processor
- Multicriteria scheduling
- Single-Machine Scheduling of Unit-Time Jobs with Earliness and Tardiness Penalties
- The Continuous Assignment Problem and Its Application to Preemptive and Non-Preemptive Scheduling with Irregular Cost Functions
- Near-Optimal Solutions of Large-Scale Single-Machine Scheduling Problems
- Solving Project Scheduling Problems by Minimum Cut Computations
- Sequencing with Earliness and Tardiness Penalties: A Review
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- A dual algorithm for the one-machine scheduling problem
- 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
- Minimizing weighted earliness and tardiness penalties in single-machine scheduling with idle time permitted
This page was built for publication: A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
