Stochastic group shop scheduling with fuzzy due dates
- 31 July 2017
- journal article
- Published by SAGE Publications in Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
- Vol. 33 (4) , 2075-2084
Abstract
The group shop scheduling (GSS) problem is a general formulation that includes the job shop and the open shop scheduling problems. This paper is the first dealing with a GSS problem with random release and processing times and fuzzy due dates. While release and processing times are assumed to be random variables with known distributions, as in many real-world situations, job due dates are considered to be fuzzy tolerating a certain amount of delay. The objective is to maximize the expected total degree of satisfaction with respect to the fuzzy due dates. The problem is formulated as a stochastic disjunctive program and then two solution approaches are developed for it, both of which act within an ant colony optimization (ACO) framework. In the first approach, to estimate the performance of a constructed schedule, each random variable is replaced by its expectation, whereas in the other approach following a simulation optimization procedure, a discrete event simulation model is employed to estimate the performance of a schedule. The proposed approaches are then compared through computational experiments.Keywords
This publication has 16 references indexed in Scilit:
- Group-shop scheduling with sequence-dependent set-up and transportation timesApplied Mathematical Modelling, 2014
- Group shop scheduling with uncertain data and a general cost objectiveThe International Journal of Advanced Manufacturing Technology, 2013
- Minimizing makespan in a group shop with fuzzy release dates and processing timesThe International Journal of Advanced Manufacturing Technology, 2012
- Group shops scheduling with makespan criterion subject to random release dates and processing timesComputers & Operations Research, 2010
- Ant colony optimization for multi-objective flow shop scheduling problemComputers & Industrial Engineering, 2008
- A fast tabu search algorithm for the group shop scheduling problemAdvances in Engineering Software, 2005
- An Ant Colony Optimization Algorithm for Shop Scheduling ProblemsJournal of Mathematical Modelling and Algorithms, 2004
- Ant colony system: a cooperative learning approach to the traveling salesman problemIEEE Transactions on Evolutionary Computation, 1997
- Ant system: optimization by a colony of cooperating agentsIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 1996
- Algorithms for Solving Production-Scheduling ProblemsOperations Research, 1960