Mathematical Modelling and Optimization of Flexible Job Shops Scheduling Problem (original) (raw)

Flexible Job-shop Scheduling Problem with Sequencing Flexibility: Mathematical Models and Solution Algorithms

2019

Co-Authorship I hereby declare that this thesis incorporates material that is result of joint research of the author and his supervisors Prof. Ahmed Azab and Prof. Fazle Baki. Chapters 3, 4, 5, 6, 7 of the thesis was co-authored with Prof. Ahmed Azab and Prof. Fazle Baki. In all the cases, the key ideas, primary contributions, experimental design, data analysis, interpretation and writing were performed by the author; Prof. Ahmed Azab and Prof. Fazle Baki provided feedback on refinement of ideas and editing of the manuscript. This joint research has been submitted to Journals and Conferences that are listed below. I am aware of the University of Windsor Senate Policy on Authorship, and I certify that I have properly acknowledged the contribution of other researchers to my thesis, and have obtained written permission from Prof. Ahmed Azab and Prof. Fazle Baki to include the above material(s) in my thesis. I certify that, with the above qualification, this thesis, and the research to which it refers, is the product of my own work. II.

Job shop scheduling by constraint satisfication

1993

DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal. If the publication is distributed under the terms of Article 25fa of the Dutch Copyright Act, indicated by the "Taverne" license above, please follow below link for the End User Agreement:

A note on the paper: Solving the job-shop scheduling problem optimally by dynamic programming

research memorandum, 2015

A note on the paper: Solving the job-shop scheduling problem optimally by dynamic programming. (Research Memorandum; No. 2015-9). Faculty of Economics and Business Administration. General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal ? Take down policy If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.

Bi-objective partial flexible job shop scheduling problem: NSGA-II, NRGA, MOGA and PAES approaches

International Journal of Production Research, 2012

This article may be used for research, teaching, and private study purposes. Any substantial or systematic reproduction, redistribution, reselling, loan, sub-licensing, systematic supply, or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to date. The accuracy of any instructions, formulae, and drug doses should be independently verified with primary sources. The publisher shall not be liable for any loss, actions, claims, proceedings, demand, or costs or damages whatsoever or howsoever caused arising directly or indirectly in connection with or arising out of the use of this material.

Production scheduling for a job shop using a mathematical model

Contemporary Engineering Sciences

Today, all organizations are continually seeking to produce high quality, reliable, and timely goods and services that meet the needs of their customers. Therefore, production scheduling is one of the most complex activities in production management in organizations. In the present work, the production projection is developed in a Job Shop system using a mathematical model of linear integer programming whose objective is to minimize the total lateness. The developed model is validated by means of an application case with three jobs and four machines, obtaining the optimum programming according to the requirements. The results obtained have been compared with a scheduling software to evaluate the performance of the proposed model.

A MILP model for an extended version of the Flexible Job Shop Problem 1

A MILP model for an extended version of the Flexible Job Shop Scheduling problem is proposed. The extension allows the precedences between operations of a job to be given by an arbitrary directed acyclic graph rather than a linear order. The goal is the minimization of the makespan. Theoretical and practical advantages of the proposed model are discussed. Numerical experiments show the performance of a commercial exact solver when applied to the proposed model. The new model is also compared with a simple extension of the model described by¨Ozgüven, ¨ Ozbakır, and Yavuz (Mathematical models for job-shop scheduling problems with routing and process plan flexibility, Applied Mathematical Modelling, 34:1539–1548, 2010), using instances from the literature and instances inspired by real data from the printing industry.

Simulation-Based Online Scheduling in a Make-To-Order Job Shop

The South African Journal of Industrial Engineering, 2009

By submitting this thesis electronically, I declare that the entirety of the work contained therein is my own, original work, that I am the owner of the copyright thereof (unless to the extent explicitly otherwise stated) and that I have not previously in its entirety or in part submitted it for obtaining any qualification.

Economic Benefits of Working Time Flexibility in Job Shop Type Manufacturing Systems

In this paper, we investigate under what market conditions regarding delivery lead time and due date reliability, the use of flexibility in daily working time in a job shop, can be beneficial. We use a working time decision rule that sets the working time for the next day equal to the value that makes the expected average job completion time equal to the average due time of the jobs in the system. We consider 18 different market scenarios, combining six different delivery lead time cost functions and three different time delivery reliability cost functions. For each of these 18 markets, for an 8-hour fixed working time contract, we determine the combination of order arrival rate and order lead time that minimizes the sum of slack capacity costs, work-in-process costs, lead time costs, and tardiness costs per order. These minimal costs under fixed working time are the benchmark for the cost benefits to be obtained with the flexible working time policy. The optimal order arrival rates and lead times under the fixed working time are found using numerical search, using analytical results for order throughput times and order tardiness as a function of order arrival rate and order lead time. The optimal order arrival rates and lead times under flexible working time are found using numerical search using order throughput times and order tardiness generated by computer simulation. We investigate this problem under shop cost conditions as found in the high-tech capital goods industry, and we have varied the lead time costs and tardiness costs to investigate the benefits of flexible working time under different market conditions. We find total cost benefits ranging from about 12% to about 32% under FCFS. Absolute cost reductions range from 0.17 to 0.30 times the average operator costs per order. This indicates that for the range of market scenarios considered, the reduction in total costs will be sufficient to compensate the operators for their willingness to work under a flexible working time contract, and still produce a decrease in total costs for the shop. .

Simulation studies in job shop scheduling—II

Computers & Industrial Engineering, 1984

Major simulation studies of dynamic job shop scheduling problem and approaches taken to model dynamic job shops have been considered in Part I[25] of this paper. In Part II we focus our attention on basic results on relative effectiveness of priority rules in job shop simulation literature. Information on surveyed articles also is provided in the Appendix.

Flexible job-shop scheduling problems with ‘AND’/‘OR’ precedence constraints

International Journal of Production Research, 2012

This article may be used for research, teaching, and private study purposes. Any substantial or systematic reproduction, redistribution, reselling, loan, sub-licensing, systematic supply, or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to date. The accuracy of any instructions, formulae, and drug doses should be independently verified with primary sources. The publisher shall not be liable for any loss, actions, claims, proceedings, demand, or costs or damages whatsoever or howsoever caused arising directly or indirectly in connection with or arising out of the use of this material.