Earliness-tardiness scheduling problems with a common delivery window

DOI10.1016/0167-6377(94)90078-7zbMath0814.90049OpenAlexW2073459177MaRDI QIDQ1342083

Sanjay Ramaswamy, Surya Danusaputro Liman

Publication date: 11 January 1995

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(94)90078-7

zbMATH Keywords

single machineweighted number of tardy jobsweighted earlinessearliness-tardiness penaltydelivery window

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items (14)

A survey on scheduling problems with due windows ⋮ Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs ⋮ Single machine scheduling to minimize weighted earliness subject to maximum tardiness ⋮ Single-Machine Scheduling Problems Simultaneous with Deteriorating and Learning Effects Under a Deteriorating Maintenance Consideration ⋮ Earliness--tardiness production planning for just-in-time manufacturing: a unifying approach by goal programming ⋮ Single-machine scheduling with a common due window ⋮ On scheduling around large restrictive common due windows ⋮ Scheduling with a common due-window: polynomially solvable cases ⋮ Parallel machine scheduling with a common due window ⋮ Determination of common due window location in a single machine scheduling problem ⋮ Scheduling identical jobs and due-window on uniform machines ⋮ An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time ⋮ A two-echelon inventory optimization model with demand time window considerations ⋮ Scheduling problems with a common due window assignment: A survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal common due-date with limited completion time deviation
• Scheduling problems with non-regular penalty functions - a review
• Single-machine scheduling to minimize earliness and number of tardy jobs
• Due window scheduling for parallel machines
• Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
• Sequencing with Earliness and Tardiness Penalties: A Review
• Investing in Reduced Setups in the EOQ Model
• Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
• Minimizing Maximum Promptness and Maximum Lateness on a Single Machine

This page was built for publication: Earliness-tardiness scheduling problems with a common delivery window