New Lower and Upper Bounds for Scheduling Around a Small Common Due Date

DOI10.1287/OPRE.42.1.102MaRDI QIDQ4287604zbMATH OpenOpenAlexFDO

Authors Han Hoogeveen, H. Oosterhout, Steef van de Velde

Publication date 6 November 1994

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/b0f87a69e04e06223a54ecb75108676a4d0e933f

zbMATH Keywords

single-machinebranch-and-boundLagrangian relaxationcommon due dateLagrangian lower and upper bounds

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling about a common due date with earliness and tardiness penalties
• Single-machine scheduling to minimize absolute deviation of completion times from a common due date
• The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm
• Scheduling around a small common due date
• Common due date assignment and scheduling with ready times

Cited in

(15)

• Parallel machine scheduling with a common due window
• A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems
• Just-in-time scheduling with equal-size jobs
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Minimizing total weighted earliness-tardiness on a single machine around a small common due date: an FPTAS using quadratic knapsack
• The symmetric quadratic knapsack problem: approximation and scheduling applications
• Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine
• Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval
• Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties
• Single machine weighted earliness-tardiness penalty problem with a common due date
• Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
• Formulating a scheduling problem with almost identical jobs by using positional completion times
• Machine scheduling with earliness, tardiness and non-execution penalties
• Multicriteria scheduling
• Error Bound of a Heuristic for the Common Due Date Scheduling Problem

This page was built for publication: New Lower and Upper Bounds for Scheduling Around a Small Common Due Date

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