AN EXACT APPROACH FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLY AND QUADRATIC TARDY PENALTIES

DOI10.1142/S0217595908001730MaRDI QIDQ3520510zbMATH OpenFDO

Authors Jorge M. S. Valente

Publication date 26 August 2008

Published in Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0217595908001730

zbMATH Keywords

lower bound

Mathematics Subject Classification ID

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

Recommendations

• A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
• Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties
• The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm
• A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
• Single machine earliness and tardiness scheduling

Cites work

• Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
• Minimizing the sum of squares lateness on a single machine
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Sequencing with Earliness and Tardiness Penalties: A Review

Cited in

(18)

• A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties
• Single machine earliness and tardiness scheduling
• Metaheuristics for the single machine weighted quadratic tardiness scheduling problem
• Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem
• Minimizing the weighted sum of squared tardiness on a single machine
• An exact approach for scheduling jobs with regular step cost functions on a single machine
• Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties
• scientific article; zbMATH DE number 3864980 (Why is no real title available?)
• Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties
• Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling
• BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS
• A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
• scientific article; zbMATH DE number 4049369 (Why is no real title available?)
• Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties
• A note on ‘Single-machine scheduling for minimizing total cost with identical, asymmetrical earliness and tardiness penalties’
• Single-machine scheduling with early and tardy completion costs
• Note—On the Single Machine Scheduling Problem with Quadratic Penalty Function of Completion Times: An Improved Branching Procedure
• Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem

This page was built for publication: AN EXACT APPROACH FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLY AND QUADRATIC TARDY PENALTIES

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