Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions-Reference-Cited by-同舟云学术

Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions

Published:2012-04 Issue:2 Volume:46 Page:125-147
ISSN:0399-0559
Container-title:RAIRO - Operations Research
language:
Short-container-title:RAIRO-Oper. Res.

Author:

Kacem Imed,Souayah Nizar,Haouari Mohamed

Publisher

EDP Sciences

Subject

Management Science and Operations Research,Computer Science Applications,Theoretical Computer Science

Link

http://www.rairo-ro.org/10.1051/ro/2012010/pdf

Reference24 articles.

1. Alidaee B. and Rosa D., Scheduling parallel machines to minimize total weighted and unweighted tardness.Comput. Oper. Res.24(1979) 75–788.

2. Anderson E.J. and Nyirenda J.C., Two new rules to minimize tardiness in a job shop.Int. J. Prod. Res.28(1990) 2277–2292.

3. Azizoglu M. and Kirka O., Tardiness minimization on parallel machines.Int. J. Prod. Econ.55(1998) 163–168.

4. Baptiste P. and Le Pape, C. Scheduling a single machine to minimize a regular objective function under setup constraints.Discrete Optim.2(2005) 83–99.

5. Baptiste P., Carlier C. and Antoine J., A branch, bound procedure to minimze total tardiness on one machine with arbitrary release dates.Eur. J. Oper. Res.158(2004) 595–608.

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

1. Dynamic scheduling of patients in emergency departments;European Journal of Operational Research;2023-10

2. Mathematical Model and Algorithm for the Reefer Mechanic Scheduling Problem at Seaports;Discrete Dynamics in Nature and Society;2017