Total completion time minimization in two-machine job shops with unit-time operations-Reference-Cited by-同舟云学术

Total completion time minimization in two-machine job shops with unit-time operations

Published:1996-10 Issue:2 Volume:94 Page:310-320
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Kubiak Wieslaw,Timkovsky Vadim

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference8 articles.

1. The Design and Analysis of Computer Algorithms;Aho,1976

2. A linear time algorithm to minimize maximum lateness for the two-machine, unit-time, job-shop, scheduling problems;Brucker;Lecture Notes in Control and Information Sciences,1982

3. Optimization and approximation in deterministic sequencing and scheduling: A survey;Graham;Annals of Discrete Mathematics,1979

4. An efficient optimal algorithm for the two-machine, unit-time, job-shop, schedule-length problem;Hefetz;Mathematical Operations Research,1982

5. A pseudopolynomial algorithm for a two-machine no-wait job shop scheduling problem;Kubiak;European Journal of Operational Research,1989

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

1. Two-Machine Job-Shop Scheduling with Equal Processing Times on Each Machine;Mathematics;2019-03-25

2. Outline of Scheduling;Online Scheduling in Manufacturing;2012-10-11

3. Using mixed graph coloring to minimize total completion time in job shop scheduling;Applied Mathematics and Computation;2006-11

4. A sequencing algorithm for makespan minimization in FMS;Journal of Manufacturing Technology Management;2004-04-01

5. Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity;European Journal of Operational Research;2003-09