|Appears in Collections:||Computing Science and Mathematics Journal Articles|
|Peer Review Status:||Refereed|
|Title:||Fuzzy job shop scheduling with lot-sizing|
|Keywords:||job shop scheduling|
fuzzy rule-based system
fuzzy multi-objective genetic algorithm
|Citation:||Petrovic S, Fayad C, Petrovic D, Burke E & Kendall G (2008) Fuzzy job shop scheduling with lot-sizing, Annals of Operations Research, 159 (1), pp. 275-292.|
|Abstract:||This paper deals with a problem of determining lot-sizes of jobs in a real-world job shop-scheduling in the presence of uncertainty. The main issue discussed in this paper is lot-sizing of jobs. A fuzzy rule-based system is developed which determines the size of lots using the following premise variables: size of the job, the static slack of the job, workload on the shop floor, and the priority of the job. Both premise and conclusion variables are modelled as linguistic variables represented by using fuzzy sets (apart from the priority of the job which is a crisp value). The determined lots' sizes are input to a fuzzy multi-objective genetic algorithm for job shop scheduling. Imprecise jobs' processing times and due dates are modelled by using fuzzy sets. The objectives that are used to measure the quality of the generated schedules are average weighted tardiness of jobs, the number of tardy jobs, the total setup time, the total idle time of machines and the total flow time of jobs. The developed algorithm is analysed on real-world data obtained from a printing company.|
|Rights:||The publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.|
|Affiliation:||University of Nottingham|
University of Nottingham
Deputy Principal's Office
University of Nottingham
|Fuzzy job shop scheduling with lot-sizing.pdf||515.95 kB||Adobe PDF||Under Embargo until 31/12/2999 Request a copy|
Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependant on the depositor still being contactable at their original email address.
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
If you believe that any material held in STORRE infringes copyright, please contact firstname.lastname@example.org providing details and we will remove the Work from public display in STORRE and investigate your claim.