Flexible job-shop scheduling problem under resource constraints

Chan, F.T.S. and Wong, T.C. and Chan, L.Y. (2006) Flexible job-shop scheduling problem under resource constraints. International Journal of Production Research, 44 (11). pp. 2071-2089. ISSN 0020-7543

Full text not available in this repository.Request a copy from the Strathclyde author

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.

ORCID iDs

Chan, F.T.S., Wong, T.C. ORCID logoORCID: https://orcid.org/0000-0001-8942-1984 and Chan, L.Y.;
CORE (COnnecting REpositories)