Online early work scheduling on parallel machines
Authors:
- Yiwei JiangYJYiwei Jiang
- Mengjing WuMWMengjing Wu
- Xin ChenXin Chen
- Jianming DongJDJianming Dong
- T.C.E. ChengTCT.C.E. Cheng
- Jacek BlazewiczJBJacek Blazewicz
- Min JiMJMin Ji
- 9 January 2024
- journal article
- research article
- Published by Elsevier in European Journal of Operational Research
- Vol. 315 (3) , 855-862
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Online scheduling of ordered flow shopsEuropean Journal of Operational Research, 2019
- Polynomial Time Approximation Scheme for Two Parallel Machines Scheduling with a Common Due Date to Maximize Early WorkJournal of Optimization Theory and Applications, 2017
- Scheduling on parallel identical machines with late work criterion: Offline and online casesJournal of Scheduling, 2015
- A survey of scheduling problems with late work criteriaOmega, 2011
- Late work minimization in a small flexible manufacturing systemComputers & Industrial Engineering, 2007
- A comparison of solution procedures for two-machine flow shop scheduling with late work criterionComputers & Industrial Engineering, 2005
- Open shop scheduling problems with late work criteriaDiscrete Applied Mathematics, 2004
- On-line scheduling revisitedJournal of Scheduling, 2000
- Single Machine Scheduling to Minimize Total Late WorkOperations Research, 1992
- Bounds for Certain Multiprocessing AnomaliesBell System Technical Journal, 1966