A note on one-processor scheduling with asymmetric earliness and tardiness penalties

DOI10.1016/0167-6377(93)90084-TzbMath0773.90037OpenAlexW2005694644MaRDI QIDQ2367041

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

Publication date: 16 August 1993

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

Full work available at URL: https://doi.org/10.1016/0167-6377(93)90084-t

zbMATH Keywords

earlinesstardinessone-processor schedulingindependent and simultaneously available jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date ⋮ Minmax earliness-tardiness costs with unit processing time jobs ⋮ Parallel machine scheduling with a common due window ⋮ Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs ⋮ BICRITERIA SCHEDULING ON SINGLE-MACHINE WITH INVENTORY OPERATIONS ⋮ 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

• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Unnamed Item

This page was built for publication: A note on one-processor scheduling with asymmetric earliness and tardiness penalties