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

DOI10.1016/0305-0548(94)E0012-VMaRDI QIDQ1342333zbMATH OpenOpenAlexFDO

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

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

due-dateheuristicNP-completesingle-machine schedulingtarget start time

Mathematics Subject Classification ID

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

Recommendations

• Single machine scheduling to minimize the number of early and tardy jobs
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
• Scheduling jobs with agreeable processing times and due dates on a single batch processing machine
• Algorithms for a class of single-machine weighted tardiness and earliness problems

Cites work

• A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• A Simple Optimality Proof of Moore's Sequencing Algorithm
• 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
• scientific article; zbMATH DE number 3757695 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3430360 (Why is no real title available?)
• On Sequencing n Jobs on One Machine to Minimize the Number of Late Jobs
• Sequencing with Earliness and Tardiness Penalties: A Review
• Survey of scheduling research involving due date determination decisions

Cited in

(11)

• Scheduling jobs with agreeable processing times and due dates on a single batch processing machine
• 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
• Single machine scheduling to minimize the number of early and tardy jobs
• Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties
• 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
• scientific article; zbMATH DE number 1031383 (Why is no real title available?)
• Parallel machine scheduling with a common due window
• A no-delay single machine scheduling problem to minimize total weighted early and late work

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

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