Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates-Reference-Cited by-同舟云学术

Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates

Published:2012-03 Issue:3 Volume:39 Page:471-478
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Nessah Rabia,Kacem Imed

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modeling and Simulation,General Computer Science

Reference20 articles.

1. Optimisation and approximation in deterministic sequencing and scheduling;Graham;Annals of Discrete Mathematics,1979

2. Complexity of machine scheduling problems;Lenstra;Annals of Discrete Mathematics,1977

3. Preemptive scheduling of uniform machines subject to release dates;Labetoulle,1984

4. Various optimizers for single-stage production;Smith;Naval Research Logistics Quarterly,1956

5. Rinaldi G, Sassano A. On a job scheduling problem with different ready times: some properties and a new algorithm to determine the optimal solution. Report R.77-24, Istituto di Automatica, Università di Roma, Italy; 1977.

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

1. A makespan minimization problem for versatile developers in the game industry;RAIRO - Operations Research;2022-11

2. A Branch-and-Bound Algorithm for Minimizing the Total Tardiness of Multiple Developers;Mathematics;2022-04-06

3. An exact dynamic programming algorithm for the precedence-constrained class sequencing problem;Computers & Operations Research;2020-12

4. Makespan minimization scheduling with ready times, group technology and shortening job processing times;The Computer Journal;2018-02-02

5. Minimizing the makespan on a single machine with flexible maintenances and jobs’ release dates;Computers & Operations Research;2017-04