Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times-Reference-Cited by-同舟云学术

Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times

Published:2002-01 Issue:1 Volume:5 Page:71-92
ISSN:1094-6136
Container-title:Journal of Scheduling
language:en
Short-container-title:J. Sched.

Author:

Cheng Jinliang,Steiner George,Stephenson Paul

Publisher

Wiley

Subject

Artificial Intelligence,Management Science and Operations Research,General Engineering,Software

Reference19 articles.

1. Optimal two- and three-stage production schedules with setup times included

2. Sequencing and scheduling: algorithms and complexity. In Handbooks in Operations Research and Management Science, Vol. 4, et al. (eds) North-Holland: Amsterdam, 1993.

3. SCHEDULING: Theory, Algorithms and Systems. Prentice-Hall: Englewood Cliffs, NJ, 1995.

4. Complexity of Machine Scheduling Problems

5. Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates

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

1. Some theorems of minimizing makespan and range of lateness of flow shop machines;BIO Web of Conferences;2024

2. A comprehensive review of Branch-and-Bound algorithms: Guidelines and directions for further research on the flowshop scheduling problem;Expert Systems with Applications;2020-11

3. An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times;Computers & Operations Research;2012-11

4. Pareto optima for total weighted completion time and maximum lateness on a single machine;Discrete Applied Mathematics;2007-10

5. A robust approach for the single machine scheduling problem;Journal of Scheduling;2007-05-11