Flexible job-shop scheduling problem under resource constraints

F.T.S. Chan, T.C. Wong, L.Y. Chan

Research output: Contribution to journalArticle

75 Citations (Scopus)

Abstract

A flexible job-shop-scheduling problem is an extension of classical job-shop problems that permit an operation of each job to be processed by more than one machine. The research methodology is to assign operations to machines (assignment) and determine the processing order of jobs on machines (sequencing) such that the system objectives can be optimized. This problem can explore very well the common nature of many real manufacturing environments under resource constraints. A genetic algorithm-based approach is developed to solve the problem. Using the proposed approach, a resource-constrained operations-machines assignment problem and flexible job-shop scheduling problem can be solved iteratively. In this connection, the flexibility embedded in the flexible shop floor, which is important to today's manufacturers, can be quantified under different levels of resource availability.
LanguageEnglish
Pages2071-2089
Number of pages19
JournalInternational Journal of Production Research
Volume44
Issue number11
DOIs
Publication statusPublished - 1 Jun 2006

Fingerprint

Genetic algorithms
Availability
Processing
Job shop scheduling
Resource constraints
Resources
Assignment problem
Genetic algorithm
Job shop problem
Order processing
Sequencing
Shopfloor
Manufacturing
Assignment

Keywords

  • resource constraints
  • genetic algorithms
  • flexible job-shop scheduling
  • operations–machines assignment
  • sequencing

Cite this

@article{c2ae3fade4d84dff82473e654d0ac98a,
title = "Flexible job-shop scheduling problem under resource constraints",
abstract = "A flexible job-shop-scheduling problem is an extension of classical job-shop problems that permit an operation of each job to be processed by more than one machine. The research methodology is to assign operations to machines (assignment) and determine the processing order of jobs on machines (sequencing) such that the system objectives can be optimized. This problem can explore very well the common nature of many real manufacturing environments under resource constraints. A genetic algorithm-based approach is developed to solve the problem. Using the proposed approach, a resource-constrained operations-machines assignment problem and flexible job-shop scheduling problem can be solved iteratively. In this connection, the flexibility embedded in the flexible shop floor, which is important to today's manufacturers, can be quantified under different levels of resource availability.",
keywords = "resource constraints, genetic algorithms, flexible job-shop scheduling, operations–machines assignment, sequencing",
author = "F.T.S. Chan and T.C. Wong and L.Y. Chan",
year = "2006",
month = "6",
day = "1",
doi = "10.1080/00207540500386012",
language = "English",
volume = "44",
pages = "2071--2089",
journal = "International Journal of Production Research",
issn = "0020-7543",
number = "11",

}

Flexible job-shop scheduling problem under resource constraints. / Chan, F.T.S.; Wong, T.C.; Chan, L.Y.

In: International Journal of Production Research, Vol. 44, No. 11, 01.06.2006, p. 2071-2089.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Flexible job-shop scheduling problem under resource constraints

AU - Chan, F.T.S.

AU - Wong, T.C.

AU - Chan, L.Y.

PY - 2006/6/1

Y1 - 2006/6/1

N2 - A flexible job-shop-scheduling problem is an extension of classical job-shop problems that permit an operation of each job to be processed by more than one machine. The research methodology is to assign operations to machines (assignment) and determine the processing order of jobs on machines (sequencing) such that the system objectives can be optimized. This problem can explore very well the common nature of many real manufacturing environments under resource constraints. A genetic algorithm-based approach is developed to solve the problem. Using the proposed approach, a resource-constrained operations-machines assignment problem and flexible job-shop scheduling problem can be solved iteratively. In this connection, the flexibility embedded in the flexible shop floor, which is important to today's manufacturers, can be quantified under different levels of resource availability.

AB - A flexible job-shop-scheduling problem is an extension of classical job-shop problems that permit an operation of each job to be processed by more than one machine. The research methodology is to assign operations to machines (assignment) and determine the processing order of jobs on machines (sequencing) such that the system objectives can be optimized. This problem can explore very well the common nature of many real manufacturing environments under resource constraints. A genetic algorithm-based approach is developed to solve the problem. Using the proposed approach, a resource-constrained operations-machines assignment problem and flexible job-shop scheduling problem can be solved iteratively. In this connection, the flexibility embedded in the flexible shop floor, which is important to today's manufacturers, can be quantified under different levels of resource availability.

KW - resource constraints

KW - genetic algorithms

KW - flexible job-shop scheduling

KW - operations–machines assignment

KW - sequencing

UR - http://www.scopus.com/inward/record.url?scp=33646400835&partnerID=8YFLogxK

U2 - 10.1080/00207540500386012

DO - 10.1080/00207540500386012

M3 - Article

VL - 44

SP - 2071

EP - 2089

JO - International Journal of Production Research

T2 - International Journal of Production Research

JF - International Journal of Production Research

SN - 0020-7543

IS - 11

ER -