A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
暂无分享,去创建一个
[1] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .
[2] J. R. Jackson. SCHEDULING A PRODUCTION LINE TO MINIMIZE MAXIMUM TARDINESS , 1955 .
[3] T. C. Hu. Parallel Sequencing and Assembly Line Problems , 1961 .
[4] R. Gomory,et al. Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .
[5] D. A. Wismer,et al. Solution of the Flowshop-Scheduling Problem with No Intermediate Queues , 1972, Oper. Res..
[6] C. V. Ramamoorthy,et al. On the Flow-Shop Sequencing Problem with No Wait in Process † , 1972 .
[7] C. V. Ramamoorthy,et al. Reply to Dr. Goyal's Comments , 1973 .
[8] C. V. Ramamoorthy,et al. A Scheduling Problem , 1973 .
[9] F G Forst. A REVIEW OF THE STATIC STOCHASTIC SEQUENCING LITERATURE , 1973 .
[10] S. K. Goyal. A Note on the Paper: On the Flow-Shop Sequencing Problem with No Wait in Process , 1973 .
[11] K. R. Baker,et al. Minimizing Mean Flowtime in the Flow Shop with No Intermediate Queues , 1974 .
[12] M. Syslo. On some machine sequencing problems (II) , 1974 .
[13] A. J. Clewett,et al. Introduction to sequencing and scheduling , 1974 .
[14] Sujit K. Dutta,et al. Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage , 1975 .
[15] Jeffrey D. Ullman,et al. NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..
[16] A. Kan. Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .
[17] Teofilo F. Gonzalez,et al. Open Shop Scheduling to Minimize Finish Time , 1976, JACM.
[18] Maurice Bonney,et al. Solutions to the Constrained Flowshop Sequencing Problem , 1976 .
[19] J. Gupta. Optimal flowshop schedules with no intermediate storage space , 1976 .
[20] David S. Johnson,et al. Scheduling Tasks with Nonuniform Deadlines on Two Processors , 1976, J. ACM.
[21] David S. Johnson,et al. Two-Processor Scheduling with Start-Times and Deadlines , 1977, SIAM J. Comput..
[22] Jan Karel Lenstra,et al. Sequencing by enumerative methods , 1977 .
[23] David S. Johnson,et al. Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness , 1977, Math. Oper. Res..
[24] Mario J. Gonzalez. Deterministic Processor Scheduling , 1977, CSUR.
[25] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[26] T. B. Tate,et al. Machine Scheduling Problems , 1978 .
[27] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[28] A. Trayse,et al. ALGORITHMS FOR MINIMAL-LENGTH SCHEDULES , 1979 .
[29] Clyde L. Monma. The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions , 1979, Oper. Res..
[30] Sartaj Sahni,et al. Complexity of Scheduling Shops with No Wait in Process , 1979, Math. Oper. Res..
[31] Christos H. Papadimitriou,et al. Flowshop scheduling with limited temporary storage , 1980, JACM.
[32] M. Fisher. Worst-Case Analysis of Heuristic Algorithms , 1980 .
[33] A. S. Spachis,et al. Heuristics for flow-shop scheduling , 1980 .
[34] S. S. Panwalkar,et al. Ordered Flow Shop Problems with no In-Process Waiting: Further Results , 1980 .
[35] Wlodzimierz Szwarc,et al. A note on the flow‐shop problem without interruptions in job processing , 1981 .
[36] Jan Karel Lenstra,et al. Recent developments in deterministic sequencing and scheduling: a survey : (preprint) , 1981 .
[37] Richard S. H. Mah,et al. An implicit enumeration scheme for the flowshop problem with no intermediate storage , 1981 .
[38] D. Pohoryles,et al. Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times , 1982 .
[39] Teofilo F. Gonzalez,et al. Unit Execution Time Shop Problems , 1982, Math. Oper. Res..
[40] R. Schonberger. Japanese Manufacturing Techniques , 1982 .
[41] Sven Axsäter. On Scheduling in a Semi-Ordered Flow Shop without Intermediate Queues , 1982 .
[42] E. L. Lawler,et al. Recent Results in the Theory of Machine Scheduling , 1982, ISMP.
[43] Michael Pinedo,et al. Minimizing the Expected Makespan in Stochastic Flow Shops , 1982, Oper. Res..
[44] R. Schonberger. Japanese manufacturing techniques : nine hidden lessons simplicity , 1982 .
[45] I. Adiri,et al. A note on the influence of missing operations on scheduling problems , 1982 .
[46] Michael Pinedo,et al. Stochastic Shop Scheduling: A Survey , 1982 .
[47] Jan Karel Lenstra,et al. Scheduling subject to resource constraints: classification and complexity , 1983, Discret. Appl. Math..
[48] Inyong Ham,et al. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .
[49] Gideon Weiss,et al. Stochastic scheduling problems I — General strategies , 1984, Z. Oper. Research.
[50] Neta Amit,et al. Openshop and flowshop scheduling to minimize sum of completion times , 1984, Comput. Oper. Res..
[51] Hans Röck,et al. The Three-Machine No-Wait Flow Shop is NP-Complete , 1984, JACM.
[52] S. Suresh,et al. Stochastically minimizing the makespan in flow shops , 1984 .
[53] Eugene L. Lawler,et al. Traveling Salesman Problem , 2016 .
[54] Rolf H. Möhring,et al. Introduction to Stochastic Scheduling Problems , 1985 .
[55] Ehl Emile Aarts,et al. Statistical cooling : a general approach to combinatorial optimization problems , 1985 .
[56] Jan Karel Lenstra,et al. Sequencing and scheduling : an annotated bibliography , 1997 .
[57] Gideon Weiss,et al. Stochastic scheduling problems II-set strategies- , 1985, Z. Oper. Research.
[58] F. Carl Knopf,et al. Sequencing a generalized two-stage flowshop with finite intermediate storage , 1985 .
[59] W. J. Selen,et al. A new formulation and solution of the flowshop scheduling problem with no in-process waiting , 1986 .
[60] R. Foley,et al. Scheduling n nonoverlapping jobs and two stochastic jobs in a flow shop , 1986 .
[61] Chelliah Sriskandarajah,et al. Some no-wait shops scheduling problems: Complexity aspect , 1986 .
[62] W. Zangwill. From EOQ Towards ZI , 1987 .
[63] Kamal Kuriyan,et al. SCHEDULING OF BATCH PROCESSES , 1987 .
[64] Edouard Wagneur,et al. Hierarchical Control Of The Two Processor Flow-Shop With State Dependent Processing Times: Complexity Analysis And Approximate Algorithms , 1988 .
[65] Robert W. Hall. Cyclic scheduling for improvement , 1988 .
[66] J. Błażewicz,et al. Scheduling unit — time tasks on flow — shops under resource constraints , 1988 .
[67] Egon Balas,et al. The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .
[68] William L. Maxwell,et al. The Role of Work-in-Process Inventory in Serial Production Lines , 1988, Oper. Res..
[69] Chelliah Sriskandarajah,et al. Scheduling algorithms for flexible flowshops: Worst and average case performance , 1988 .
[70] Chelliah Sriskandarajah,et al. Performance of scheduling algorithms for no-wait flowshops with parallel machines , 1988 .
[71] Manfred K. Warmuth,et al. A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs , 1989, SIAM J. Comput..
[72] Michael Pinedo,et al. Sequencing in an Assembly Line with Blocking to Minimize Cycle Time , 1989, Oper. Res..
[73] G. Reklaitis,et al. Scheduling network flowshops so as to minimize makespan , 1989 .
[74] Chelliah Sriskandarajah,et al. Scheduling of a Two-machine Flowshop with Processing Time Linearly Dependent on Job Waiting-time , 1989 .
[75] W. Kubiak. A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem , 1989 .
[76] Naoki Makimoto,et al. Stochastic Minimization of the Makespan in Flow Shops with Identical Machines and Buffers of Arbitrary Size , 1990, Oper. Res..
[77] D. Chaudhuri,et al. Heuristic algorithms for continuous flow-shop problem , 1990 .
[78] Rainer Leisten,et al. Flowshop sequencing problems with limited buffer storage , 1990 .
[79] Fred Glover,et al. Tabu Search: A Tutorial , 1990 .
[80] J. Pekny,et al. Exact solution of the no-wait flowshop scheduling problem with a comparison to heuristic methods , 1991 .
[81] Toshihide Ibaraki,et al. Automated Two-machine Flowshop Scheduling: A Solvable Case , 1991 .
[82] W. Kubiak,et al. A Note On The Complexity Of Openshop Scheduling Problems , 1991 .
[83] René van Dal,et al. Solvable Cases of the No-Wait Flow-Shop Scheduling Problem , 1991 .
[84] S. S. Panwalkar,et al. The Lessons of Flowshop Scheduling Research , 1992, Oper. Res..
[85] Chelliah Sriskandarajah,et al. The two‐machine permutation flow shop with state‐dependent processing times , 1992 .
[86] Chelliah Sriskandarajah,et al. Optimal control of a class of DEDS: Flow-shops with state-dependent processing times , 1993, Discret. Event Dyn. Syst..
[87] Chelliah Sriskandarajah,et al. The complexity of scheduling jobs in repetitive manufacturing systems , 1993 .
[88] C. Sriskandarajah,et al. Two-machine group scheduling problem with blocking and anticipatory setups , 1993 .
[89] Amar Ramudhin,et al. On The Complexity Of The Process Shop , 1994 .
[90] Vitaly A. Strusevich,et al. Two Machine Flow Shop Scheduling Problem with No Wait in Process: Controllable Machine Speeds , 1995, Discret. Appl. Math..
[91] H. D. Ratliff,et al. Generating daily production schedules in process industries , 1995 .
[92] Rasaratnam Logendran,et al. Sequencing of robot activities and parts in two-machine robotic cells , 1996 .
[93] Chelliah Sriskandarajah,et al. Scheduling in Robotic Cells: Classification, Two and Three Machine Cells , 1997, Oper. Res..