Flexible job-shop scheduling problem under resource constraints

Tung Sun Chan, T. C. Wong, L. Y. Chan

Research output: Journal article publicationJournal articleAcademic researchpeer-review

82 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.
Original languageEnglish
Pages (from-to)125-143
Number of pages19
JournalInternational Journal of Production Research
Volume44
Issue number11
DOIs
Publication statusPublished - 1 Jun 2006
Externally publishedYes

Keywords

  • Flexible job-shop scheduling
  • Genetic algorithms
  • Operations-machines assignment
  • Resource constraints
  • Sequencing

ASJC Scopus subject areas

  • Strategy and Management
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Cite this