Fuzzy job shop scheduling with lot-sizing

  title={Fuzzy job shop scheduling with lot-sizing},
  author={Sanja Petrovic and Carole Fayad and Dobrila Petrovic and Edmund K. Burke and Graham Kendall},
  journal={Annals of Operations Research},
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… 

Fuzzy optimisation of multi-objective job shop scheduling based on inventory information

Fuzzy processing times of operations and fuzzy due dates of jobs are considered to incorporate fuzziness in the problem and genetic algorithm (GA) is used as a heuristic technique with specially encoded chromosomes that denotes the complete schedule of the jobs.

Minimizing the maximum tardiness and makespan criteria in a job shop scheduling problem with sequence dependent setup times

A two-objective model to solve JSP with sequence-dependent setup times (SDST) and optimizing of the both objectives simultaneously (makespan and maximum tardiness) bring us closer to natural-world problems.

Automatic Design of Dispatching Rules for Job Shop Scheduling with Genetic Programming

A genetic programming based hyper-heuristic (GPHH) approach for automatic heuristic design of reusable and competitive dispatching rules in job shop scheduling environments and shows that evolved rules can dominate well-known dispatches rules when a single objective and multiple objectives are considered.

Survey on fuzzy shop scheduling

The goal of this paper is to provide an extensive review for the fuzzy machine scheduling literature which it covers more than 140 papers and classifies and reviews the literature according to shop environments, including single machine, parallel machines, flowshop, job shop and open shop.

Fuzzy approaches for robust job shop rescheduling

Results and statistical analysis show that a robust initial schedule combined with match-up rescheduling lead to higher quality and more reliable schedules even when jobs with different urgency levels arrive in a dynamic and uncertain shop floor.

Match-up strategies and fuzzy robust scheduling for a complex dynamic real world job shop scheduling problem

Analysis of match-up algorithms and their combination with fuzzy robust scheduling has a positive effect on responding to these disruptions leading to even more reliable solutions in a real world dynamic and uncertain shop floor.

Multi-objective optimization of integrated lot-sizing and scheduling problem in flexible job shops

A hybrid meta-heuristic based on a combination of Genetic algorithm and particle swarm optimization algorithm is developed to solve flexible job shop problem and surpasses the other algorithms in the closeness of solutions to pareto optimal front and diversity criteria.

Hybrid Tabu Search for Fuzzy Job Shop

We consider the fuzzy job shop scheduling problem, which is a variant of the well-known job shop problem, with uncertainty in task durations that we model using fuzzy numbers. We propose a tabu

Solving a flexible job shop lot sizing problem with shared operations using a self-adaptive COA

A novel mathematical model is developed to optimise lot sizing and scheduling simultaneously using a product- oriented approach as opposed to the job-oriented approach which has been prevalently considered in the literature.

A New model for integrated lot sizing and scheduling in flexible job shop problem

An integrated lot-sizing and scheduling problem in a flexible job shop environment with machine-capacity-constraint is studied and a modified harmony search algorithm with a new built-in local search heuristic is proposed as solution technique.



A Fuzzy Genetic Algorithm for Real-World Job Shop Scheduling

A genetic algorithm is developed to search for the solution with maximum satisfaction grades for the objectives of a fuzzy job shop scheduling problem and is tested on real-world data from a printing company.

Fuzzy Job Shop Scheduling

One Machine Scheduling Problem with Fuzzy Random Due-Dates

This paper proposes an n-job, one machine scheduling model, where due-dates for jobs are fuzzy random variables, and they are non-increasing functions, but their support positions depend upon the expected due- dates, which are exponentially distributed random variables.

Local search algorithms for flow shop scheduling with fuzzy due-dates☆

Fuzzy optimization-based scheduling of identical machines with possible breakdown

  • Yong LiP. LuhX. Guan
  • Business
    Proceedings of the 1994 IEEE International Conference on Robotics and Automation
  • 1994
A fuzzy optimization methodology for scheduling single operation parts on identical machines with possible breakdowns is presented, and preliminary testing results show that this algorithm outperforms the deterministic one.

Single machine scheduling problem with fuzzy precedence relation