Scheduling a two-stage flowshop under makespan constraint
暂无分享,去创建一个
Milind Dawande | Ram Rachamadugu | Srinagesh Gavirneni | S. Gavirneni | Milind Dawande | Ram Rachamadugu
[1] Jatinder N. D. Gupta,et al. The two-machine flowshop scheduling problem with total tardiness , 1989, Comput. Oper. Res..
[2] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .
[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[4] Thomas E. Morton,et al. Resource-constrained multi-project scheduling with tardy costs: Comparing myopic, bottleneck, and resource pricing heuristics , 1993 .
[5] Michael Pinedo,et al. Scheduling: Theory, Algorithms, and Systems , 1994 .
[6] William L. Maxwell,et al. Theory of scheduling , 1967 .
[7] David Simchi-Levi,et al. The Asymptotic Optimality of the SPT Rule for the Flow Shop Mean Completion Time Problem , 2001, Oper. Res..
[8] Ari P. J. Vepsalainen. Priority rules for job shops with weighted tardiness costs , 1987 .
[9] Jatinder N. D. Gupta,et al. Minimizing tardy jobs in a flowshop with common due date , 2000, Eur. J. Oper. Res..
[10] J. M. Moore,et al. A Functional Equation and its Application to Resource Allocation and Sequencing Problems , 1969 .
[11] Thomas E. Morton,et al. Selecting jobs for a heavily loaded shop with lateness penalties , 1996, Comput. Oper. Res..
[12] R. A. Dudek,et al. A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .
[13] Oscar H. Ibarra,et al. Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.
[14] Jr. Marcus P Meleton. OPT-Fantasy or breakthrough? , 1986 .
[15] Thomas E. Morton,et al. Heuristic scheduling systems : with applications to production systems and project management , 1993 .
[16] Milind Dawande,et al. Inference-Based Sensitivity Analysis for Mixed Integer/Linear Programming , 2000, Oper. Res..
[17] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .
[18] D. S. Palmer. Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .
[19] Wieslaw Kubiak,et al. Scheduling shops to minimize the weighted number of late jobs , 1994, Oper. Res. Lett..