Flexible job shop scheduling problem for parallel batch processing machine with compatible job families

Abstract Flexible Job-Shop Scheduling Problem (FJSP) with Parallel Batch processing Machine (PBM) is studied. First, a Mixed Integer Programming (MIP) formulation is proposed for the first time. In order to address an NP-hard structure of this problem, the formulation is modified to selectively schedule jobs. Although there are many jobs on a given floor, semiconductor manufacturing is most challenged by priority jobs that promise a significant amount of financial compensation in exchange for an expedited delivery. This modification could leave some non-priority jobs unscheduled. However, it vastly expedites the discovery of improving solutions by first branching on integer variables with higher priority jobs. This study then turns job-dependent processing times into job-independent ones by assuming a machine has an equal processing time on different jobs. This assumption is roughly true or acceptable for the sake of the reduced computational time in the industry. These changes significantly reduce computational time compared to the original model when tested on a set of common problem instances from the literature. Computational results show that this proposed model can generate an effective schedule for large problems. Author encourages other researchers to propose an improved MIP model.

[1]  Claude Yugma,et al.  Production control in semiconductor manufacturing with time constraints , 2015, 2015 26th Annual SEMI Advanced Semiconductor Manufacturing Conference (ASMC).

[2]  R. Bixby,et al.  Short-Interval Detailed Production Scheduling in 300mm Semiconductor Manufacturing using Mixed Integer and Constraint Programming , 2006, The 17th Annual SEMI/IEEE ASMC 2006 Conference.

[3]  Janne Huiskonen,et al.  Maintenance spare parts logistics: Special characteristics and strategic choices , 2001 .

[4]  Alexandra M. Newman,et al.  Practical Guidelines for Solving Difficult Mixed Integer Linear , 2013 .

[5]  Stéphane Dauzère-Pérès,et al.  A batching and scheduling algorithm for the diffusion area in semiconductor manufacturing , 2012 .

[6]  Chiung Moon,et al.  Advanced planning and scheduling with outsourcing in manufacturing supply chain , 2002 .

[7]  Jaehyung An,et al.  IP-Based Real-Time Dispatching for Two-Machine Batching Problem With Time Window Constraints , 2011, IEEE Transactions on Automation Science and Engineering.

[8]  Parviz Fattahi,et al.  A mathematical model and genetic algorithm to cyclic flexible job shop scheduling problem , 2015, J. Intell. Manuf..

[9]  Dong-Seok Sun,et al.  Scheduling and control for time-constrained processes in semiconductor manufacturing , 2005, ISSM 2005, IEEE International Symposium on Semiconductor Manufacturing, 2005..

[10]  D. P. Martin.  The advantages of using short cycle time manufacturing (SCM) instead of continuous flow manufacturing (CFM) , 1998, IEEE/SEMI 1998 IEEE/SEMI Advanced Semiconductor Manufacturing Conference and Workshop (Cat. No.98CH36168).

[11]  Rashed Sahraeian,et al.  On the optimal modeling and evaluation of job shops with a total weighted tardiness objective: Constraint programming vs. mixed integer programming , 2015 .

[12]  Lin Li,et al.  Multi-Objective Flexible Job-Shop Scheduling Problem in Steel Tubes Production , 2009 .

[13]  Mitsuo Gen,et al.  Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm , 2006, J. Intell. Manuf..

[14]  Mohammad Mohammadi,et al.  Scheduling flexible job-shops with transportation times: Mathematical models and a hybrid imperialist competitive algorithm , 2017 .

[15]  Christoph S. Thomalla.  Job shop scheduling with alternative process plans , 2001 .

[16]  Chinyao Low,et al.  Modelling and heuristics of FMS scheduling with multiple objectives , 2006, Comput. Oper. Res..

[17]  Luis Puigjaner,et al.  MIP-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: A benchmark scheduling problem of the pharmaceutical industry , 2010, Eur. J. Oper. Res..

[18]  Pius J. Egbelu,et al.  SCHEDULING IN A PRODUCTION ENVIRONMENT WITH MULTIPLE PROCESS PLANS PER JOB , 1999 .

[19]  Lale Özbakır,et al.  Mathematical models for job-shop scheduling problems with routing and process plan flexibility , 2010 .

[20]  Fariborz Jolai,et al.  Mathematical modeling and heuristic approaches to flexible job shop scheduling problems , 2007, J. Intell. Manuf..

[21]  Chinyao Low,et al.  Mathematical modelling and heuristic approaches to operation scheduling problems in an FMS environment , 2001 .

[22]  Young Hoon Lee,et al.  Real-time scheduling of multi-stage flexible job shop floor , 2011 .

[23]  Mostafa Zandieh,et al.  Bi-objective optimization research on integrated fixed time interval preventive maintenance and production for scheduling flexible job-shop problem , 2011, Expert Syst. Appl..

[24]  Liang Gao,et al.  An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem , 2009, Comput. Ind. Eng..

[25]  S.M.T. Fatemi Ghomi,et al.  The common cycle economic lot scheduling in flexible job shops: The finite horizon case , 2005 .

[26]  Alireza Fallahi,et al.  Dynamic scheduling in flexible job shop systems by considering simultaneously efficiency and stability , 2010 .

[27]  Marie-Ange Manier,et al.  A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times , 2012, Comput. Oper. Res..

[28]  Mohammad Saidi-Mehrabad,et al.  Flexible job shop scheduling with tabu search algorithms , 2007 .

[29]  Jamal Arkat,et al.  Flexible job shop scheduling with overlapping in operations , 2009 .

[30]  Jiyin Liu,et al.  A global MILP model for FMS scheduling , 1997, Eur. J. Oper. Res..

[31]  Marcel Stehli,et al.  An effective problem decomposition method for scheduling of diffusion processes based on mixed integer linear programming , 2014, ASMC 2013 SEMI Advanced Semiconductor Manufacturing Conference.

[32]  Hisashi Tamaki,et al.  Modeling and genetic solution of a class of flexible job shop scheduling problems , 2001, ETFA 2001. 8th International Conference on Emerging Technologies and Factory Automation. Proceedings (Cat. No.01TH8597).

[33]  Yunus Demir,et al.  Evaluation of mathematical models for flexible job-shop scheduling problems , 2013 .

[34]  N. Imanipour,et al.  Modeling & Solving Flexible Job Shop Problem With Sequence Dependent Setup Times , 2006, 2006 International Conference on Service Systems and Service Management.

[35]  Andreas Klemmt,et al.  Scheduling jobs with time constraints between consecutive process steps in semiconductor manufacturing , 2012, Proceedings Title: Proceedings of the 2012 Winter Simulation Conference (WSC).