A linear time algorithm to minimize maximum lateness for the two-machine, unit-time, job-shop, scheduling problem-Reference-Cited by-同舟云学术

A linear time algorithm to minimize maximum lateness for the two-machine, unit-time, job-shop, scheduling problem

Published: Issue: Volume: Page:566-571
ISSN:
Container-title:System Modeling and Optimization
language:
Short-container-title:

Author:

Brucker P.

Publisher

Springer-Verlag

Link

http://link.springer.com/content/pdf/10.1007/BFb0006180.pdf

Reference3 articles.

1. P. BRUCKER [1980], Minimizing maximum lateness in a two-machine unit-time job-shop. To appear in Computing.

2. N. HEFETZ and I. ADIRI [1979], An efficient optimal algorithm for for two-machines, unit-time, job-shop, schedule-length, problem. Operations Research, Statistics and Economics Mimeograph Series No. 237, Technion-Israel Institute of Technology.

3. C.L. MONMA [1981], Linear time algorithm for scheduling equal length tasks with due dates on parallel processors subject to precedence constraints. To appear in Operations Research.

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

1. Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem;Discrete Applied Mathematics;2000-01

2. A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem;Discrete Applied Mathematics;1997-08

3. Total completion time minimization in two-machine job shops with unit-time operations;European Journal of Operational Research;1996-10

4. Determination of due dates in job shop scheduling by simulated annealing;Computer Integrated Manufacturing Systems;1996-05

5. An efficient algorithm for a job shop problem;Annals of Operations Research;1995-12