SEQUENCING IN MIXED MODEL NON-PERMUTATION FLOWSHOP PRODUCTION LINES USING CONSTRAINED BUFFERS

[1]  Frank Werner,et al.  Complexity of mixed shop scheduling problems: A survey , 2000, Eur. J. Oper. Res..

[2]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[3]  Jonathan F. Bard,et al.  A branch-and-bound algorithm for permutation flow shops with sequence-dependent setup times , 1999 .

[4]  C. Dennis Pegden,et al.  A survey and evaluation of static flowshop scheduling heuristics , 1984 .

[5]  Michel Gendreau,et al.  A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times , 2001, Eur. J. Oper. Res..

[6]  Robert R. Inman,et al.  ASRS sizing for recreating automotive assembly sequences , 2003 .

[7]  Rainer Leisten,et al.  Flowshop sequencing problems with limited buffer storage , 1990 .

[8]  Armin Schirmer,et al.  Heuristische Verfahren zur Maschinenbelegungsplanung bei Reihenfertigung , 1975, Z. Oper. Research.

[9]  S. S. Panwalkar,et al.  The Lessons of Flowshop Scheduling Research , 1992, Oper. Res..

[10]  Soumen Ghosh,et al.  A comprehensive literature review and analysis of the design, balancing and scheduling of assembly systems , 1989 .

[11]  Em Dar-El,et al.  Optimal mixed-model sequencing for balanced assembly lines , 1977 .

[12]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[13]  Chris N. Potts,et al.  Permutation vs. non-permutation flow shop schedules , 1991, Oper. Res. Lett..

[14]  Thomas E. Morton,et al.  Heuristic scheduling systems : with applications to production systems and project management , 1993 .

[15]  Chung Yee Lee,et al.  A Classification of Static Scheduling Problems , 1993 .

[16]  Yeongho Kim,et al.  A genetic alorithm for multiple objective sequencing problems in mixed model assembly lines , 1998 .

[17]  Richard Bellman,et al.  Mathematical Aspects Of Scheduling And Applications , 1982 .

[18]  Xi Sun,et al.  Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling , 2003, Eur. J. Oper. Res..

[19]  N. Anantharaman,et al.  Performance enhancement by using non-permutation schedules in flowline-based manufacturing systems , 2003 .

[20]  Jeffrey W. Herrmann,et al.  Rescheduling Manufacturing Systems: A Framework of Strategies, Policies, and Methods , 2003, J. Sched..

[21]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[22]  F.-Y. Ding,et al.  Sequence alteration and restoration related to sequenced parts delivery on an automobile mixed-model assembly line with multiple departments , 2004 .

[23]  Paul A. Rubin,et al.  Scheduling in a sequence dependent setup environment with genetic search , 1995, Comput. Oper. Res..

[24]  Heungsoon Felix Lee,et al.  Sequencing methods for automated storage and retrieval systems with dedicated storage , 1997 .

[25]  Paul Bratley,et al.  A guide to simulation , 1983 .

[26]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[27]  L. Darrell Whitley,et al.  Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance , 2002, INFORMS J. Comput..

[28]  Suna Kondakci Köksalan,et al.  A flexible flowshop problem with total flow time minimization , 2001, Eur. J. Oper. Res..

[29]  In-Beum Lee,et al.  Intermediate storage tank operation strategies in the production scheduling of multi-product batch processes , 2000 .

[30]  Ahmet Bolat,et al.  Sequencing jobs on an automobile assembly line: objectives and procedures , 1994 .

[31]  J. Carlier,et al.  Two branch and bound algorithms for the permutation flow shop problem , 1996 .

[32]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[33]  Ali Allahverdi,et al.  Total flowtime in no-wait flowshops with separated setup times , 1998, Comput. Oper. Res..

[34]  Armin Scholl,et al.  Balancing and Sequencing of Assembly Lines , 1995 .

[35]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .

[36]  Don T. Phillips,et al.  A state-of-the-art survey of dispatching rules for manufacturing job shop operations , 1982 .

[37]  B. R. Sarker,et al.  Design configuration for a closed-station, mixed-model assembly line: A filing cabinet manufacturing system , 2001 .

[38]  Yeongho Kim,et al.  A Coevolutionary Algorithm for Balancing and Sequencing in Mixed Model Assembly Lines , 2000, Applied Intelligence.

[39]  D. Chaudhuri,et al.  An efficient heuristic approach to the scheduling of jobs in a flowshop , 1992 .

[40]  Inder Khosla.  The scheduling problem where multiple machines compete for a common local buffer , 1995 .

[41]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[42]  Michael J. Shaw,et al.  A neural-net approach to real time flow-shop sequencing , 2000 .

[43]  Chandrasekharan Rajendran,et al.  Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs , 2004, Eur. J. Oper. Res..

[44]  Armin Scholl,et al.  State-of-the-art exact and heuristic solution procedures for simple assembly line balancing , 2006, Eur. J. Oper. Res..

[45]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[46]  Andrei Tchernykh,et al.  Algorithms for dynamic scheduling of unit execution time tasks , 2003, Eur. J. Oper. Res..

[47]  Hisao Ishibuchi,et al.  Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling , 2003, IEEE Trans. Evol. Comput..

[48]  R. Bellman.  Dynamic programming. , 1957, Science.

[49]  Joaquín Bautista,et al.  Heuristics and exact algorithms for solving the Monden problem , 1996 .

[50]  Milan Vlach,et al.  Nonpreemptive flowshop scheduling with machine dominance , 1998, Eur. J. Oper. Res..

[51]  Hao Niu,et al.  Sequencing and balancing problem of mixed-model-assembly-line with window cycle time , 2005 .

[52]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

[53]  Tadeusz Sawik,et al.  Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers , 2000 .

[54]  Shanling Li,et al.  A hybrid two-stage flowshop with part family, batch production, major and minor set-ups , 1997 .

[55]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[56]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[57]  Sujit K. Dutta,et al.  Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage , 1975 .

[58]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[59]  Jan Karel Lenstra,et al.  Sequencing and scheduling : an annotated bibliography , 1997 .

[60]  Albert Corominas,et al.  Branch and win: OR tree search algorithms for solving combinatorial optimisation problems , 2004 .

[61]  N. Anantharaman,et al.  Generating non-permutation schedules in flowline-based manufacturing sytems with sequence-dependent setup times of jobs: a heuristic approach , 2004 .

[62]  Andreas Witt,et al.  Simple heuristics for scheduling with limited intermediate storage , 2007, Comput. Oper. Res..

[63]  C. Liao,et al.  A performance evaluation of permutation vs. non-permutation schedules in a flowshop , 2006 .

[64]  Sedef Meral,et al.  Bicriteria sequencing methods for the mixed-model assembly line in just-in-time production systems , 2001, Eur. J. Oper. Res..

[65]  Mika Johnsson,et al.  Techniques and Applications of Production Planning in Electronics Manufacturing Systems , 1999 .

[66]  Peter Brucker,et al.  Flow-shop problems with intermediate buffers , 2003, OR Spectr..

[67]  Rubén Ruiz,et al.  TWO NEW ROBUST GENETIC ALGORITHMS FOR THE FLOWSHOP SCHEDULING PROBLEM , 2006 .

[68]  Wonjoon Choi,et al.  A real-time sequence control system for the level production of the automobile assembly line , 1997 .

[69]  Yeongho Kim,et al.  Sequencing in mixed model assembly lines: A genetic algorithm approach , 1996, Comput. Oper. Res..

[70]  Gary D. Scudder,et al.  Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..

[71]  Jatinder N. D. Gupta,et al.  Technical Note - Improved Dominance Conditions for the Three-Machine Flowshop Scheduling Problem , 1978, Oper. Res..

[72]  B. J. Lageweg,et al.  A General Bounding Scheme for the Permutation Flow-Shop Problem , 1978, Oper. Res..

[73]  E. Ignall,et al.  Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems , 1965 .

[74]  Saif Benjaafar,et al.  Resequencing and feature assignment on an automated assembly line , 2003, IEEE Trans. Robotics Autom..

[75]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[76]  W. E. Wilhelm,et al.  Effectiveness of alternate operations in a flexible manufacturing system , 1985 .

[77]  Tomas Engström,et al.  Alternatives to line assembly: Some Swedish examples , 1996 .

[78]  David G. Dannenbring,et al.  An Evaluation of Flow Shop Sequencing Heuristics , 1977 .

[79]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[80]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[81]  Armin Scholl,et al.  A survey on problems and methods in generalized assembly line balancing , 2006, Eur. J. Oper. Res..

[82]  Z. A. Lomnicki.  A “Branch-and-Bound” Algorithm for the Exact Solution of the Three-Machine Scheduling Problem , 1965 .

[83]  John H. Holland,et al.  Genetic Algorithms and the Optimal Allocation of Trials , 1973, SIAM J. Comput..

[84]  Bhaba R. Sarker,et al.  Designing a mixed-model assembly line to minimize the costs of idle and utility times , 1998 .

[85]  Fred Glover,et al.  Tabu Search: A Tutorial , 1990 .

[86]  Abdelhakim Artiba,et al.  A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan , 1998, Eur. J. Oper. Res..

[87]  Carlos F. Daganzo,et al.  Assembly line job sequencing principles , 1987 .

[88]  Stéphane Dauzère-Pérès,et al.  Genetic algorithms to minimize the weighted number of late jobs on a single machine , 2003, Eur. J. Oper. Res..

[89]  Ali Allahverdi,et al.  The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime , 2003, Eur. J. Oper. Res..

[90]  S. S. Reddi,et al.  Note---Sequencing with Finite Intermediate Storage , 1976 .

[91]  J. Bukchin,et al.  A comparative study of performance measures for throughput of a mixed model assembly line in a JIT environment , 1998 .

[92]  Vipul Jain,et al.  A Disjunctive Model for Scheduling in a Manufacturing and Packing Facility with Intermediate Storage , 2000 .

[93]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

[94]  John B. Kidd,et al.  Toyota Production System , 1993 .

[95]  Avraham Shtub,et al.  An analytic framework for sequencing mixed model assembly lines , 1992 .

[96]  E. A. Silver,et al.  An overview of heuristic solution methods , 2004, J. Oper. Res. Soc..

[97]  Subhash C. Sarin,et al.  A survey of the assembly line balancing procedures , 1998 .

[98]  Loren Paul Rees,et al.  Sequencing mixed-model assembly lines with genetic algorithms , 1996 .

[99]  Christos H. Papadimitriou,et al.  Flowshop scheduling with limited temporary storage , 1980, JACM.

[100]  Chandrasekharan Rajendran,et al.  A study on the performance of scheduling rules in buffer-constrained dynamic flowshops , 2002 .

[101]  Fan T. Tseng,et al.  Two models for a family of flowshop sequencing problems , 2002, Eur. J. Oper. Res..