On scheduling cycle shops: classification, complexity and approximation
暂无分享,去创建一个
[1] I. Adiri,et al. V-shop scheduling , 1984 .
[2] S. A. Beletskii,et al. Optimization of multistage cyclic service of a production line by a transmanipulator , 1988 .
[3] Wieslaw Kubiak,et al. Sequencing of parts and robot moves in a robotic cell , 1989 .
[4] Joseph Y.-T. Leung,et al. Minimizing Total Tardiness on a Single Machine with Precedence Constraints , 1990, INFORMS J. Comput..
[5] S. T. Mccormick,et al. Some complexity results in cyclic scheduling , 1994 .
[6] Yves Crama,et al. Cyclic scheduling in robotic flowshops , 2000, Ann. Oper. Res..
[7] Sigrid Knust,et al. Makespan minimization for flow-shop problems with transportation times and a single robot , 2001, Discret. Appl. Math..
[8] Yves Crama,et al. Cyclic Scheduling of Identical Parts in a Robotic Cell , 1997, Oper. Res..
[9] Michael Pinedo,et al. Scheduling: Theory, Algorithms, and Systems , 1994 .
[10] Chelliah Sriskandarajah,et al. Some no-wait shops scheduling problems: Complexity aspect , 1986 .
[11] Yash P. Aneja,et al. Scheduling of parts and robot activities in a two machine robotic cell , 1999, Comput. Oper. Res..
[12] Wieslaw Kubiak,et al. Total completion time minimization in two-machine job shops with unit-time operations , 1996 .
[13] Claire Hanen,et al. Study of a NP-hard cyclic scheduling problem: The recurrent job-shop , 1994 .
[14] Jan Karel Lenstra,et al. Complexity results for scheduling chains on a single machine : (preprint) , 1980 .
[15] David S. Johnson,et al. Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness , 1977, Math. Oper. Res..
[16] Robin Roundy. Cyclic Schedules for Job Shops with Identical Jobs , 1992, Math. Oper. Res..
[17] Alix Munier. The complexity of a cyclic scheduling problem with identical machines and precedence constraints , 1996 .
[18] Alessandro Agnetis,et al. Part sequencing in three-machine no-wait robotic cells , 2000, Oper. Res. Lett..
[19] Jan Karel Lenstra,et al. Complexity of Scheduling under Precedence Constraints , 1978, Oper. Res..
[20] John L. Bruno,et al. Deterministic Scheduling with Pipelined Processors , 1980, IEEE Transactions on Computers.
[21] Walter Ukovich,et al. A Mathematical Model for Periodic Scheduling Problems , 1989, SIAM J. Discret. Math..
[22] Claire Hanen,et al. A Study of the Cyclic Scheduling Problem on Parallel Processors , 1995, Discret. Appl. Math..
[23] Vadim G. Timkovsky,et al. A Polynomial-time Algorithm for the Two-machine Unit-time Release-date Job-shop Schedule-length Problem , 1997, Discret. Appl. Math..
[24] Vadim G. Timkovsky,et al. Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity , 2003, Eur. J. Oper. Res..
[25] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[26] Timothy J. Lowe,et al. Structured p-facility location problems on the line solvable in polynomial time , 1997, Oper. Res. Lett..
[27] Vladimir Kats,et al. A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling , 1997, Oper. Res. Lett..
[28] Eugene L. Lawler,et al. Sequencing and scheduling: algorithms and complexity , 1989 .
[29] Svetlana A. Kravchenko. A polynomial algorithm for a two-machine no-wait job-shop scheduling problem , 1998, Eur. J. Oper. Res..
[30] Peter M. Kogge,et al. The Architecture of Pipelined Computers , 1981 .
[31] Jeffrey D. Ullman,et al. NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..
[32] Joseph Y.-T. Leung,et al. Preemptive Scheduling to Minimize Mean Weighted Flow Time , 1990, Inf. Process. Lett..
[33] Eugene Levner,et al. Cyclic Scheduling of Operations for a Part Type in an FMS Handled by a Single Robot: A Parametric Critical-Path Approach , 1998 .
[34] ApproachesUday S. Rao,et al. Subproblems in Identical Jobs Cyclic Scheduling : Properties , Complexity and Solution , 1993 .
[35] M. Y. Wang,et al. Minimizing Makespan in a Class of Reentrant Shops , 1997, Oper. Res..
[36] J. K. Lenstra,et al. Computational complexity of discrete optimization problems , 1977 .
[37] Vadim G. Timkovsky,et al. Is a Unit-time Job Shop Not Easier Than Identical Parallel Machines? , 1998, Discret. Appl. Math..
[38] Guochuan Zhang,et al. A new approximation algorithm for UET-Scheduling with chain-type precedence constraints , 1998, Comput. Oper. Res..
[39] Svetlana A. Kravchenko. Minimizing the Number of Late Jobs for the Two-machine Unit-time Job-shop Scheduling Problem , 2000, Discret. Appl. Math..
[40] V. A. Strusevich,et al. A heuristic algorithm for two‐machine re‐entrant shop scheduling , 1999, Ann. Oper. Res..
[41] Sigrid Knust. Shop-Scheduling Problems with Transportation , 2000 .
[42] Chelliah Sriskandarajah,et al. Scheduling in robotic cells: Complexity and steady state analysis , 1998, Eur. J. Oper. Res..
[43] Vadim E. Levit,et al. An improved algorithm for cyclic flowshop scheduling in a robotic cell , 1997 .
[44] Chelliah Sriskandarajah,et al. Scheduling in Robotic Cells: Classification, Two and Three Machine Cells , 1997, Oper. Res..
[45] Upendra Dave,et al. Heuristic Scheduling Systems , 1993 .
[46] Luigi Poiaga. Operations research in project management and cost engineering: An outlook for new operational developments , 1989 .
[47] Toshihide Ibaraki,et al. Automated Two-machine Flowshop Scheduling: A Solvable Case , 1991 .
[48] R. Ramazani,et al. Repetitive pure flowshop problem: a permutation approach , 1993 .
[49] Svetlana A. Kravchenko. On the complexity of minimizing the number of late jobs in unit time open shop , 2000, Discret. Appl. Math..
[50] Oliver Vornberger,et al. On Some Variants of the Bandwidth Minimization Problem , 1984, SIAM J. Comput..
[51] Stephen C. Graves,et al. Scheduling of re-entrant flow shops , 1983 .
[52] Alessandro Agnetis,et al. Scheduling no-wait robotic cells with two and three machines , 2000, Eur. J. Oper. Res..
[53] Jan Karel Lenstra,et al. Complexity of machine scheduling problems , 1975 .
[54] TAE-EOG LEE,et al. Performance Measures and Schedules in Periodic Job Shops , 1997, Oper. Res..