Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties

DOI10.1016/J.COR.2013.01.019zbMATH Open1348.90319OpenAlexW2017841433MaRDI QIDQ336376FDOQ336376

Authors: Mariona Vilà, Jordi Pereira 

Publication date: 10 November 2016

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

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

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

zbMATH Keywords

dynamic programmingassignment problemschedulingsingle machinetime-indexed formulation

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11)

Cites Work

• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• Title not available (Why is that?)
• Assignment Problems
• A Dynamic Programming Approach to Sequencing Problems
• Title not available (Why is that?)
• A time indexed formulation of non-preemptive single machine scheduling problems
• The schedule-sequencing problem
• Single machine scheduling with sequence-dependent family setups to minimize maximum lateness
• Title not available (Why is that?)
• A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
• Using short-term memory to minimize the weighted number of late jobs on a single machine.
• Sequencing with Earliness and Tardiness Penalties: A Review
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
• Single machine earliness and tardiness scheduling
• Minimizing the weighted sum of squared tardiness on a single machine
• The one-machine problem with earliness and tardiness penalties
• Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties
• Time-indexed formulations and the total weighted tardiness problem
• A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
• The Single Machine Early/Tardy Problem
• Coordinating Aggregate and Detailed Scheduling Decisions in the One-Machine Job Shop: Part I. Theory
• Minimizing Total Costs in One-Machine Scheduling
• On single-machine scheduling without intermediate delays

Cited In (14)

• Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties
• The single machine weighted mean squared deviation problem
• BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS
• AN EXACT APPROACH FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLY AND QUADRATIC TARDY PENALTIES
• An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem
• On the flexibility of a decision theory-based heuristic for single machine scheduling
• Single machine scheduling problem with interval processing times to minimize mean weighted completion time
• Metaheuristics for the single machine weighted quadratic tardiness scheduling problem
• 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
• The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
• Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem
• 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

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)