Novel approaches to cyclic job-shop problems with transportation
暂无分享,去创建一个
[1] Alexandre E. Eichenberger,et al. Efficient formulation for optimal modulo schedulers , 1997, PLDI '97.
[2] E. Nowicki,et al. A fast tabu search algorithm for the permutation flow-shop problem , 1996 .
[3] Hirofumi Matsuo. Cyclic sequencing problems in the two‐machine permutation flow shop: Complexity, worst‐case, and average‐case analysis , 1990 .
[4] Robin Roundy. Cyclic Schedules for Job Shops with Identical Jobs , 1992, Math. Oper. Res..
[5] Thomas Kampmeyer,et al. Cyclic Scheduling Problems , 2006 .
[6] Sheik Meeran,et al. Deterministic job-shop scheduling: Past, present and future , 1999, Eur. J. Oper. Res..
[7] Eugene Levner,et al. A Parametric Critical Path Problem and an Application for Cyclic Scheduling , 1998, Discret. Appl. Math..
[8] H. Neil Geismar,et al. Sequencing and Scheduling in Robotic Cells: Recent Developments , 2005, J. Sched..
[9] Dr. Zbigniew Michalewicz,et al. How to Solve It: Modern Heuristics , 2004 .
[10] Helman I. Stern,et al. Scheduling Parts in a Combined Production-transportation Work Cell , 1990 .
[11] Uwe Schwiegelshohn,et al. Generating Close to Optimum Loop Schedules on Parallel Processors , 1994, Parallel Process. Lett..
[12] E. Nowicki,et al. A block approach for single-machine scheduling with release dates and due dates , 1986 .
[13] Peter Brucker,et al. A Branch and Bound Algorithm for the Job-Shop Scheduling Problem , 1994, Discret. Appl. Math..
[14] Yves Crama,et al. Cyclic scheduling in 3-machine robotic flow shops , 1999 .
[15] S. T. Mccormick,et al. Some complexity results in cyclic scheduling , 1994 .
[16] Vadim E. Levit,et al. An improved algorithm for cyclic flowshop scheduling in a robotic cell , 1997 .
[17] Joaquim P. Marques de Sá,et al. Applied statistics : using SPSS, STATISTICA, and MATLAB , 2003 .
[18] Heinz Gröflin,et al. A new neighborhood and tabu search for the Blocking Job Shop , 2009, Discret. Appl. Math..
[19] E. Nowicki,et al. A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .
[20] Klaus Jansen,et al. Makespan minimization in job shops: a polynomial time approximation scheme , 1999, STOC '99.
[21] Eugene Levner,et al. A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times , 2011, Eur. J. Oper. Res..
[22] Jan Karel Lenstra. Job Shop Scheduling , 1992 .
[23] Laurence A. Wolsey,et al. Cutting planes in integer and mixed integer programming , 2002, Discret. Appl. Math..
[24] 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 .
[25] Dario Pacciarelli,et al. A Rollout Metaheuristic for Job Shop Scheduling Problems , 2004, Ann. Oper. Res..
[26] Luca Maria Gambardella,et al. Effective Neighborhood Functions for the Flexible Job Shop Problem , 1998 .
[27] Dario Pacciarelli,et al. Job-shop scheduling with blocking and no-wait constraints , 2002, Eur. J. Oper. Res..
[28] Fred Glover,et al. Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges , 1997 .
[29] Peter Brucker,et al. Lower Bounds for Scheduling a Single Robot in a Job-Shop Environment , 2002, Ann. Oper. Res..
[30] Chelliah Sriskandarajah,et al. The complexity of scheduling jobs in repetitive manufacturing systems , 1993 .
[31] Saeed Zolfaghari,et al. A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: The case of job shop scheduling , 2007, Eur. J. Oper. Res..
[32] Eugene Levner,et al. Multiple-part cyclic hoist scheduling using a sieve method , 1999, IEEE Trans. Robotics Autom..
[33] S. Shapiro,et al. An Analysis of Variance Test for Normality (Complete Samples) , 1965 .
[34] David B. Shmoys,et al. A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem , 1996, IPCO.
[35] G. Dantzig,et al. FINDING A CYCLE IN A GRAPH WITH MINIMUM COST TO TIME RATIO WITH APPLICATION TO A SHIP ROUTING PROBLEM , 1966 .
[36] Eugene Levner,et al. An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times , 2006, Oper. Res. Lett..
[37] T. C. Edwin Cheng,et al. Complexity of cyclic scheduling problems: A state-of-the-art survey , 2010, Comput. Ind. Eng..
[38] Konstantin Kogan,et al. Scheduling a two-machine robotic cell: A solvable case , 1995, Ann. Oper. Res..
[39] Yves Robert,et al. Circuit Retiming Applied to Decomposed Software Pipelining , 1998, IEEE Trans. Parallel Distributed Syst..
[40] Peter L. Jackson,et al. Finding minimum flow time cyclic schedules for non-identical, multistage jobs , 2008 .
[41] Albert Jones,et al. Survey of Job Shop Scheduling Techniques , 1999 .
[42] Yves Robert,et al. Introduction to Scheduling , 2009, CRC computational science series.
[43] Michael Pinedo,et al. Sequencing in an Assembly Line with Blocking to Minimize Cycle Time , 1989, Oper. Res..
[44] Ravi Sethi,et al. The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..
[45] K. Caggiano,et al. Cyclic Scheduling with Acyclic Job Precedence Constraints: Improvement Heuristics , 2002 .
[46] Christian Scheideler,et al. Improved Bounds for Acyclic Job Shop Scheduling , 2002, Comb..