A branch-and-bound procedure for a single-machine earliness scheduling problem with two agents-Reference-Cited by-同舟云学术

A branch-and-bound procedure for a single-machine earliness scheduling problem with two agents

Published:2013-02 Issue:2 Volume:13 Page:1042-1054
ISSN:1568-4946
Container-title:Applied Soft Computing
language:en
Short-container-title:Applied Soft Computing

Author:

Yin Yunqiang,Wu Chin-Chia,Wu Wen-Hsiang,Hsu Chou-Jung,Wu Wen-Hung

Publisher

Elsevier BV

Subject

Software

Reference41 articles.

1. R. Ahmadi, U. Bagchi, Single machine scheduling to minimize earliness subject to deadlines, Working Paper 86/86-4-17, Department of Management, University of Texas, Austin, 1986.

2. R. Ahmadi, U. Bagchi, Just-in-time scheduling in single machine systems, Working Paper 85/86-4-21, Department of Management, University of Texas, Austin, 1986.

3. Scheduling problems with two competing agents;Agnetis;Operations Research,2004

4. Multi-agent single machine scheduling;Agnetis;Annals of Operations Research,2007

5. A Lagrangian approach to single-machine scheduling problems with two competing agents;Agnetis;Journal of Scheduling,2009

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

1. Exploring the evolution of machine scheduling through a computational approach;Engineering Applications of Artificial Intelligence;2024-07

2. A parallel algorithm based on quantum annealing and double-elite spiral search for mixed-integer optimal control problems in engineering;Applied Soft Computing;2022-07

3. Adaptive neighborhood simulated annealing for sustainability-oriented single machine scheduling with deterioration effect;Applied Soft Computing;2021-10

4. Production Scheduling Optimization to Minimize Makespan and the Number of Machines with Mixed Integer Linear Programming;IOP Conference Series: Materials Science and Engineering;2021-01-01

5. A three-agent scheduling problem for minimizing the flow time on two machines;RAIRO - Operations Research;2020-02-27