Late work minimization in a small flexible manufacturing system

The paper concerns a small flexible manufacturing system consisting of three CNC machines: a lathe machine, milling machine and measurement center and a single robot, located at the Poznan University of Technology. A short description of the production environment, which can be modeled as the extended job shop system with open shop sections within particular jobs, is followed by the proposition of a branch and bound method. It optimizes production plans within a single shift in order to minimize the late work, i.e. the amount of work executed after a given due date. Based on results of computational experiments, conclusions are formulated on the efficiency of the B&B algorithm and on the behavior of FMS under consideration.

[1]  Malgorzata Sterna,et al.  Open shop scheduling problems with late work criteria , 2004, Discret. Appl. Math..

[2]  Chris N. Potts,et al.  Approximation algorithms for scheduling a single machine to minimize total late work , 1992, Oper. Res. Lett..

[3]  Malgorzata Sterna,et al.  Metaheuristics for Late Work Minimization in Two-Machine Flow Shop with Common Due Date , 2005, KI.

[4]  J. Carlier,et al.  Adjustment of heads and tails for the job-shop problem , 1994 .

[5]  Andrew Kusiak,et al.  Flexible manufacturing systems : methods and studies , 1986 .

[6]  Malgorzata Sterna,et al.  Dominance relations for two-machine flow shop problem with late work criterion , 2007 .

[7]  Joseph Y.-T. Leung,et al.  Handbook of Scheduling: Algorithms, Models, and Performance Analysis , 2004 .

[8]  Chris N. Potts,et al.  A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work , 1994, Math. Oper. Res..

[9]  Jon Rigelsford,et al.  Scheduling Computer and Manufacturing Processes 2nd Edition , 2002 .

[10]  P. Pardalos,et al.  Handbook of Combinatorial Optimization , 1998 .

[11]  Wolfgang Domschke,et al.  Operations Research Proceedings 1999 , 2000 .

[12]  Gerd Finke,et al.  Minimizing Mean Weighted Execution Time Loss on Identical and Uniform Processors , 1987, Inf. Process. Lett..

[13]  Malgorzata Sterna.  Late work scheduling in shop systems , 2006 .

[14]  Bahram Alidaee,et al.  Single machine scheduling to minimize total weighted late work: a comparison of scheduling rules and search algorithms , 2002 .

[15]  Malgorzata Sterna,et al.  Flow Shop Scheduling with Late Work Criterion - Choosing the Best Solution Strategy , 2004, AACC.

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

[17]  Jacek Blazewicz,et al.  Scheduling preemptible tasks on parallel processors with information loss , 1984 .

[18]  Malgorzata Sterna,et al.  Total Late Work Criteria for Shop Scheduling Problems , 2000 .

[19]  Erwin Pesch,et al.  Learning in Automated Manufacturing: A Local Search Approach , 1994 .

[20]  Klaus H. Ecker,et al.  Scheduling Computer and Manufacturing Processes , 2001 .

[21]  Malgorzata Sterna,et al.  A Branch and Bound Algorithm for the Job Shop Scheduling Problem , 1998 .

[22]  Malgorzata Sterna,et al.  Heuristic algorithm for schedule optimization in FMS environment , 1999 .

[23]  Chris N. Potts,et al.  Single Machine Scheduling to Minimize Total Weighted Late Work , 1995, INFORMS J. Comput..

[24]  Ron Shamir,et al.  Minimizing the number of tardy job units under release time constraints , 1990, Discret. Appl. Math..

[25]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

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

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

[28]  Joseph Y.-T. Leung,et al.  Minimizing the Weighted Number of Tardy Task Units , 1994, Discret. Appl. Math..

[29]  R. Haupt,et al.  A survey of priority rule-based scheduling , 1989 .

[30]  Kathryn E. Stecke,et al.  Flexible manufacturing systems : operations research models and applications , 1985 .

[31]  Jacek Blazewicz,et al.  A note on the two machine job shop with the weighted late work criterion , 2007, J. Sched..

[32]  Chris N. Potts,et al.  Single Machine Scheduling to Minimize Total Late Work , 1992, Oper. Res..

[33]  Malgorzata Sterna,et al.  A comparison of solution procedures for two-machine flow shop scheduling with late work criterion , 2005, Comput. Ind. Eng..

[34]  Malgorzata Sterna,et al.  The two-machine flow-shop problem with weighted late work criterion and common due date , 2005, Eur. J. Oper. Res..

[35]  Jacek Blazewicz,et al.  The job shop scheduling problem: Conventional and new solution techniques , 1996 .

[36]  Peter Brucker,et al.  A Branch and Bound Algorithm for the Job-Shop Scheduling Problem , 1994, Discret. Appl. Math..