See this document in CiteSeerX!

On Scheduling Cycle Shops: Classification, Complexity And Approximation  (Make Corrections)  
Martin Middendorf, Vadim G. Timkovsky



  Home/Search   Context   Related

 
View or download:
pages.sprint.ca/timko/files/d.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  pages.sprint.ca/...VadimTimkovsky (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: . This paper considers problems of nding nonperiodic and periodic schedules in a cycle shop which is a special case of a job shop but an extension of a ow shop. The cycle shop means the machine environment where all jobs have to pass the machines over the same route like in a ow shop but some of the machines in the route can be met more than once. We propose a classi cation of cycle shops and show that recently studied reentrant ow shops, robotic ow shops, loop reentrant owshops and V... (Update)

Similar documents (at the sentence level):
32.8%:   On Scheduling Cycle Shops: Classification, Complexity And.. - Middendorf, Timkovsky   (Correct)

Active bibliography (related documents):   More   All
2.0:   Identical Parallel Machines Vs Unit-Time Shops And Preemptions.. - Timkovsky (2000)   (Correct)
1.7:   How To Make Brucker's Algorithm Polynomial: Scheduling By.. - Timkovsky (1999)   (Correct)
1.5:   Flow-Shop Problems with Transportation Times and a Single Robot - Hurink, Knust (1999)   (Correct)

Similar documents based on text:   More   All
0.5:   Reducibility Among Scheduling Classes - Timkovsky   (Correct)
0.5:   Fourteen Notes on Equal-Processing-Time Scheduling - Baptiste, Brucker, Knust (2002)   (Correct)
0.4:   Transversal Graphs For Partially Ordered Sets: - Sequencing Merging And   (Correct)

BibTeX entry:   (Update)

@misc{ middendorf-scheduling,
  author = "Martin Middendorf and Vadim G. Timkovsky",
  title = "On Scheduling Cycle Shops: Classification, Complexity And Approximation",
  url = "citeseer.ist.psu.edu/435559.html" }
Citations (may not include all citations):
4212   Computers and intractability: a guide to the theory of NPcom.. (context) - Garey, Johnson - 1979
112   NP-complete scheduling problems (context) - Ullman - 1975
97   The architecture of pipelined computers (context) - Kogge - 1981
95   Complexity of machine scheduling problems (context) - Lenstra, Kan et al. - 1977
51   Complexity of scheduling under precedence constraints (context) - Lenstra, Kan - 1978
43   Algorithms and Systems (context) - Pinedo, Theory - 1995
35   Heuristic scheduling systems (context) - Morton, Pentico - 1993
20   Deterministic scheduling with pipelined processors (context) - Bruno, Jones et al. - 1980
20   Scheduling equal-length tasks under tree-like precedence con.. (context) - Brucker, Garey et al. - 1977
19   Private communication (context) - Lenstra
16   A study of the cyclic scheduling problem on parallel process.. - Hannen, Munier - 1995
13   Complexity results for single-machine problems with positive.. - Brucker, Knust - 1999
11   Is a unit-time job shop not easier than identical parallel m.. - Timkovsky - 1998
11   On some variants of the bandwidth minimization problem (context) - Leung, Vornberger et al. - 1984
10   Sequencing of parts and robot moves in a robotic cell (context) - Sethi, Sriskandarajah et al. - 1992
10   Cyclic schedules for job shops with identical jobs (context) - Roundy - 1992
9   Complexity results for scheduling chains on a single machine (context) - Lenstra, Kan - 1980
9   A polynomial-time algorithm for the two-machine unit-time re.. - Timkovsky - 1997
8   A polynomial-time algorithm for total completion time minimi.. (context) - Kubiak, Timkovsky - 1996
7   Minimizing the number of late jobs for the two-machine unit-.. (context) - Kravchenko - 1999
7   the complexity of scheduling an arbitrary system (context) - Timkovsky
7   Cyclic scheduling of identical parts in a robotic cell (context) - Crama, Klundert - 1997
6   Shop-scheduling problems with transportation (context) - Knust - 1999
6   Flow-shop problems with transportation times and a single ro.. - Hurink, Knust - 1998
5   An approximation for the cycle-shop scheduling problem (context) - Timkovsky - 1986
5   A polynomial time algorithm for a two-machine no-wait job-sh.. (context) - Kravchenko - 1998
5   Robots and Manufacturing automation (context) - Asfahl - 1985
5   the complexity of minimizing the number of late jobs in unit.. (context) - Kravchenko - 1999
5   Minimizing Total Tardiness on a Single Machine with Preceden.. (context) - Leung, Young - 1990
5   Some no-wait jobs scheduling problems: complexity results (context) - Sriskandarajah, Ladet - 1986
4   Preemption can make parallel machine scheduling problems har.. - Brucker, Kravchenko - 1999
4   Operations research: complexity results of scheduling proble.. (context) - Brucker, Knust
4   A strongly polynomial algorithm for no-wait cyclic robotic o.. (context) - Kats, Levner - 1997
4   Computational complexity and approximation of the cycle shop.. (context) - Timkovsky - 1981
3   The complexity of a cyclic scheduling problem with identical.. - Munier - 1996
3   Subproblems in identical jobs cyclic scheduling: properties - Rao, Jackson - 1993
3   Cyclic scheduling in robotic owshops (context) - Crama, Kats et al. - 2000
3   A methematical model for periodic scheduling problems (context) - Serani, Ukovich - 1989
3   Scheduling no-wait robotic cells with two and three machines (context) - Agnetis - 2000
3   shop scheduling (context) - Lev, Adiri - 1984
3   Some complexity results in cyclic scheduling (context) - McCormick, Rao - 1994
3   Polynomial-time algorithm for the Lenstra{Rinnooy Kan two-ma.. (context) - Timkovsky - 1985
3   unit-time shops and preemptions vs (context) - Timkovsky, machines - 1998
3   Minimizing total completion time in two-machine job shops wi.. (context) - Kravchenko - 1994
2   periodic schedules in cyclic scheduling (context) - Carlier, etienne et al. - 1990
2   Cyclic scheduling problems: an overview (context) - Hannen, Munier - 1996
2   Scheduling of parts and robot activities in a two-machine ro.. (context) - Aneja, Kamoun - 1999
2   Scheduling in robotic cells: classication (context) - Hall, Kamoun et al. - 1997
2   Cyclic scheduling of operations for a part type in an FMS ha.. (context) - Kats, Levner
2   Exact solution of a cyclic scheduling problem (context) - Kats, Mikhailetsky - 1980
2   A heuristic algorithm for two-machine re-entrant shop schedu.. (context) - Drobouchevitch, Strusevich - 1999
2   Optimization of multi-stage cyclic service of a production l.. (context) - Mikhalevich, Beletsky et al. - 1988
2   Cycle-shop scheduling problems solvable in pseudopolynomial .. (context) - Middendorf - 1999
2   A proof of the Lei and Wang claim (context) - Brauner, Finke et al. - 1997
2   Scheduling in robotic cells: complexity and steady state ana.. (context) - Hall, Kamoun et al. - 1998
2   Preemptive scheduling to minimize mean weighted ow time (context) - Leung, Young - 1990
2   Periodic shop scheduling problems (context) - Hall, Lee et al. - 1997
2   Automated two-machine owshop scheduling: a solvable case (context) - Kise, Shioyama et al.
2   Computational complexity of discrete optimixation problems (context) - Lenstra, Kan - 1979
2   A new approximation algorithm for UET-scheduling with chaint.. (context) - Han, Wen et al. - 1998
2   Study of an NP-hard cyclic scheduling problem: the periodic .. (context) - Hannen - 1994
2   A proof on the NP-completeness of the hoist scheduling probl.. (context) - Lei, Wang - 1989
2   Discrete mathematics in the world of machines and parts: int.. (context) - Timkovsky - 1992
2   Performance measures and schedule patterns in periodic job s.. (context) - Lee, Posner - 1997
1   a model of optimal planning systems of ow type (context) - Degtiarev, Timkovsky - 1976
1   On transition processes in systems of ow type (context) - Timkovsky - 1977
1   Scheduling of re-entrant ow shops (context) - Graves, Meal et al. - 1983
1   esolution d'un probleme d'ordonnancement cyclique a itera.. (context) - Munier - 1991
1   A scheduling problem in automated ow line with an automated .. (context) - Livshits, Mikhailetsky et al. - 1974
1   Two-stage reentrant owshop problem with repeated processing .. (context) - Gupta - 1993
1   Repetitive pure owshop problem: a permutation approach (context) - Ramazini, Younis - 1993
1   Transient behavior in a exible assembly system (context) - McCormick, Pinedo et al. - 1991
1   An improved algorithm for cyclic owshop scheduling in a robo.. (context) - Levner, Kats et al. - 1997
1   Part sequencing in three machine no-wait robotic cells - Agnetis, Pacciarelli - 1998
1   A mathematical model for the xed-time trac control problem (context) - Serani, Ukovich - 1989
1   Robotic owshop scheduling is strongly NP-complete - Crama, Klundert - 1997

Documents on the same site (http://pages.sprint.ca/timko/VadimTimkovsky.html):   More
Shortest Consistent Superstrings Computable In Polynomial Time - Jiang, Timkovsky (1995)   (Correct)
Is A Unit-Time Job Shop Not Easier Than Identical Parallel.. - Timkovsky (1998)   (Correct)
How To Make Brucker's Algorithm Polynomial - Timkovsky   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC