A note on one-processor scheduling with asymmetric earliness and tardiness penalties
From MaRDI portal
Publication:2367041
DOI10.1016/0167-6377(93)90084-TzbMATH Open0773.90037OpenAlexW2005694644MaRDI QIDQ2367041FDOQ2367041
Authors: Chung-Lun Li, Zhi-Long Chen, T. C. Edwin Cheng 
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
Recommendations
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Minimizing the earliness and tardiness cost of a sequence of tasks on a single machine.
Cites Work
Cited In (9)
- Parallel machine scheduling with a common due window
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs
- Scheduling with batch setup times and earliness-tardiness penalties
- Minmax earliness-tardiness costs with unit processing time jobs
- Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date
- A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
- BICRITERIA SCHEDULING ON SINGLE-MACHINE WITH INVENTORY OPERATIONS
- Title not available (Why is that?)
This page was built for publication: A note on one-processor scheduling with asymmetric earliness and tardiness penalties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367041)
