Single machine scheduling of deteriorating jobs to minimize total absolute differences in completion times-Reference-Cited by-同舟云学术

Single machine scheduling of deteriorating jobs to minimize total absolute differences in completion times

Published:2009-04 Issue:2 Volume:118 Page:424-429
ISSN:0925-5273
Container-title:International Journal of Production Economics
language:en
Short-container-title:International Journal of Production Economics

Author:

Li Yongqiang,Li Gang,Sun Linyan,Xu Zhiyong

Publisher

Elsevier BV

Subject

Industrial and Manufacturing Engineering,Management Science and Operations Research,Economics and Econometrics,General Business, Management and Accounting

Reference25 articles.

1. Scheduling with time dependent processing times: review and extensions;Alidaee;Journal of the Operational Research Society,1998

2. Minimizing maximum lateness under linear deterioration;Bachman;European Journal of Operational Research,2000

3. Minimizing the total weighted completion time of deteriorating jobs;Bachman;Information Processing Letters,2002

4. Scheduling deteriorating jobs on a single processor;Browne;Operations Research,1990

5. Parallel machine scheduling with time dependent processing times;Chen;Discrete Applied Mathematics,1996

Cited by 37 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A lion optimization algorithm for an integrating maintenance planning and production scheduling problem with a total absolute deviation of completion times objective;Soft Computing;2022-09-15

2. Some Scheduling Problems With Job Rejection And A Learning Effect;The Computer Journal;2022-01-04

3. Minimizing total absolute deviation of job completion times on a single machine with maintenance activities using a Lion Optimization Algorithm;Sustainable Operations and Computers;2022

4. Two parallel identical machines scheduling to minimise the maximum inter-completion time;International Journal of Production Research;2019-11-11

5. Makespan minimization for the m-machine ordered flow shop scheduling problem;Computers & Operations Research;2019-11