Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties
From MaRDI portal
Publication:336376
Recommendations
- Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties
- AN EXACT APPROACH FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLY AND QUADRATIC TARDY PENALTIES
- A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
- Single machine earliness and tardiness scheduling
- A heuristic for single machine scheduling with early and tardy costs
Cites work
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 3550186 (Why is no real title available?)
- A Dynamic Programming Approach to Sequencing Problems
- A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
- A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
- A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- A time indexed formulation of non-preemptive single machine scheduling problems
- Assignment Problems
- Coordinating Aggregate and Detailed Scheduling Decisions in the One-Machine Job Shop: Part I. Theory
- Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties
- Minimizing Total Costs in One-Machine Scheduling
- Minimizing the weighted sum of squared tardiness on a single machine
- On single-machine scheduling without intermediate delays
- Sequencing with Earliness and Tardiness Penalties: A Review
- Single machine earliness and tardiness scheduling
- Single machine scheduling with sequence-dependent family setups to minimize maximum lateness
- The Single Machine Early/Tardy Problem
- The one-machine problem with earliness and tardiness penalties
- The schedule-sequencing problem
- Time-indexed formulations and the total weighted tardiness problem
- Using short-term memory to minimize the weighted number of late jobs on a single machine.
Cited in
(14)- AN EXACT APPROACH FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLY AND QUADRATIC TARDY PENALTIES
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
- Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties
- An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem
- Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem
- Single machine scheduling problem with interval processing times to minimize mean weighted completion time
- On the flexibility of a decision theory-based heuristic for single machine scheduling
- The single machine weighted mean squared deviation problem
- Metaheuristics for the single machine weighted quadratic tardiness scheduling problem
- BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS
- INEH-VNS algorithm solved automatic production system scheduling problem under just-in-time environment
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
- Algorithms to minimize total completion time in a two-machine flowshop problem with uncertain set-up times
- A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
This page was built for publication: Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336376)
