Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs

DOI10.1016/0305-0548(94)E0012-VzbMath0812.90068OpenAlexW2035086169MaRDI QIDQ1342333

Zhi-Long Chen, Cheng, T. C. Edwin, Chung-Lun Li

Publication date: 11 January 1995

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

Full work available at URL: https://doi.org/10.1016/0305-0548(94)e0012-v

zbMATH Keywords

single-machine schedulingheuristicNP-completedue-datetarget start time

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties ⋮ Parallel machine scheduling with a common due window ⋮ Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs ⋮ Scheduling with batch setup times and earliness-tardiness penalties ⋮ A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
• Survey of scheduling research involving due date determination decisions
• Sequencing with Earliness and Tardiness Penalties: A Review
• A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• On Sequencing n Jobs on One Machine to Minimize the Number of Late Jobs
• A Simple Optimality Proof of Moore's Sequencing Algorithm

This page was built for publication: Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs