1 |
Baker, K. and Kanet, J. (1983), Job Shop Scheduling with Modified Due Dates, Journal of Operations Management, 4, 11-22
DOI
ScienceOn
|
2 |
Balas, E. (1979), Disjunctive Programming, Annals of Discrete Mathematics, 5, 3-51
DOI
|
3 |
Lawrence, S. and Morton, T. (1993), Resource Constrained Multi-Project Scheduling with Tardy Costs: Comparing Myopic, Bottleneck, and Resource Pricing Heuristics,' European Journal of Operational Research, 64, 168-187
DOI
ScienceOn
|
4 |
Sidney, J. (1975), Decomposition Algorithms for Single Machine Sequencing with Precedence Relations and Deferral Costs, Operations Research, 23, 283-298
DOI
ScienceOn
|
5 |
Lawler, E. (1977), A 'Pseudopolynomial' Algorithm for Sequencing Jobs to Minimize Total Tardiness, Annals of Discrete Mathematics, 1, 331-342
DOI
|
6 |
Ross, G. and Soland, R. (1975), A Branch and Bound Algorithm for the Generalized Assignment Problem, Mathematical Programming, 8, 91-103
DOI
|
7 |
Ullman, J. (1975), NP-Complete Scheduling Problems, Journal of Computers and Systems Science, 10, 384-391
DOI
ScienceOn
|
8 |
Bean, J., Birge, J., Mittentha1, J. and Noon, C. (1991), Matchup Scheduling with Multiple Resources, Release Dates and Disruptions, Operations Research, 39, 470-481
DOI
ScienceOn
|
9 |
Potts, C. and van Wassenhove, L. (1982), A Decomposition Algorithm for the Single Machine Total Tardiness Problem, Operations Research Letters, 1, 177-181
DOI
ScienceOn
|
10 |
Morton, T., Lawrence, S., Rajagopalan, S. and Kerke, S. (1988), SCHED-STAR: A Price-Based Shop Scheduling Module, Journal of Manufacturing and Operations Management, 1, 131-18l
|
11 |
Kong, M. and Kim, J. (2000), A Heuristic Algorithm for Resource Constrained Multi-Project Scheduling, IE Interfaces, 13, 110-119
|
12 |
Pritsker, A. and Watters, L. (1968), A Zero-One Programming Approach to Scheduling with Limited Resources, The RAND Corporation, RM-5561-PR
|
13 |
Roundy, R., Maxwell, Y., Herer, S. and Getzler, A. (1991), A Price-Directed Approach to Real Time Scheduling of Production Operations, IIE Transaction, 23, 149-160
DOI
ScienceOn
|
14 |
Kim, D. (2004), Unrelated Parallel Machine Scheduling for PCB Manufacturing, Journal of the Society of Korea Industrial and Systems Engineering, 27, 141-146
|
15 |
Adams. J., Balas, E. and Zawack, D. (1988), The Shifting Bottleneck Procedure for Job Shop Scheduling, Management Science, 34, 391-401
DOI
ScienceOn
|
16 |
Vepsalainen, A. and Morton, T. (1987), Priority Rules for Job Shops with Weighted Tardy Costs, Management Science, 33, 95-103
DOI
ScienceOn
|
17 |
Applegate, D. and Cook, W. (1991), A Computational Study of the Job-Shop scheduling Problem, ORSA Journal on Computing, 3, 149-156
DOI
|