Author:
Ovacik Irfan M.,Uzsoy Reha
Reference39 articles.
1. Adams, J., Balas, E., Zawack, D., “The Shifting Bottleneck Procedure for Job-Shop Scheduling”, Management Science 34, 391–401 (1988).
2. Applegate, D., Cook, W., “A Computational Study of the Job Shop Scheduling Problem”, ORSA Journal on Computing 3, 149–156 (1991).
3. Balas, E., “Machine Sequencing via Disjunctive Graphs: An Implicit Enumeration Approach”, Operations Research 17, 941–957 (1969).
4. Balas, E., Lenstra, J.K., Vazacopoulos, A., “One Machine Scheduling with Delayed Precedence Constraints”, Management Science 41, 94–109 (1995).
5. Bazaraa, M.S., Jarvis, J.J., Linear Programming and Network Flows, John Wiley, New York (1977).