Single machine scheduling to minimize weighted earliness subject to maximum tardiness

DOI10.1016/S0305-0548(96)00037-8zbMath0890.90092OpenAlexW2002843187MaRDI QIDQ1373894

Xiangtong Qi, Tsiushuang Chen, Feng-Sheng Tu

Publication date: 25 November 1997

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

Full work available at URL: https://doi.org/10.1016/s0305-0548(96)00037-8

zbMATH Keywords

single machineheuristicmaximum tardinessweighted earlinessprecedence relationships

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs ⋮ Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date ⋮ Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method

Cites Work

• Single machine scheduling to minimize weighted earliness subject to no tardy jobs
• Scheduling problems with non-regular penalty functions - a review
• Earliness-tardiness scheduling problems with a common delivery window
• Single machine scheduling to minimize mean absolute lateness: A heuristic solution
• Scheduling with monotonous earliness and tardiness penalties
• Sequencing with Earliness and Tardiness Penalties: A Review
• 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
• A Note on the V-shaped Property in One-Machine Scheduling