Population-based neighborhood search for job shop scheduling with interval processing time

Authors:
Deming Lei
Affiliations:
School of Automation, Wuhan University of Technology, 122 Luoshi Road Wuhan, Hubei Province, China
Venue:
Computers and Industrial Engineering
Year:
2011

Citing 5
Cited 0

An efficient genetic algorithm for job-shop scheduling problems with fuzzy processing time and fuzzy duedate

Computers and Industrial Engineering - Special issue on computational intelligence for industrial engineering
Interval regression analysis using support vector networks

Fuzzy Sets and Systems
A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem

Computers and Operations Research
Fuzzy job shop scheduling problem with availability constraints

Computers and Industrial Engineering
Fuzzy programming for multiobjective fuzzy job shop scheduling with alternative machines through genetic algorithms

ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part II

Quantified Score

Hi-index	0.02

Visualization

Abstract

This paper applies interval number theory to production scheduling for its advantage in uncertainty modeling. A job shop scheduling problem with interval processing time is first described and then a population-based neighborhood search (PNS) is presented to optimize the interval makespan of the problem. In PNS, an ordered operation-based representation is used and a decoding procedure is constructed by using operations of interval numbers, in which there are no approximate treatments. It is proved that the possible actual makespan of each schedule are contained in its interval makespan. A swap operation and binary tournament selection are applied to update the population. PNS is finally tested by using some instances and computational results show that PNS can provide better results than some methods from the literature.