Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Scheduling job families on non-identical parallel machines with time constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Obeid, A. ; Dept. Manuf. Sci. & Logistics, Ecole des Mines de St.- Etienne, Gardanne, France ; Dauzere-Peres, S. ; Yugma, C.

This paper studies the scheduling of lots (jobs) of different product types (job families) on parallel machines, where not all machines are able (i.e. are qualified) to process all job families (non-identical machines). This is known in the literature as scheduling with machine eligibility restrictions. A special time constraint, associated with each job family, should be satisfied for a machine to remain qualified for processing a job family. This constraint imposes that there must be at most a given time interval (threshold) between processing two jobs of the same job family, on a qualified machine. A machine is considered to be qualified to process a certain job if and only if, at a given time instant t, the time threshold corresponding to the job family of the job is not violated. This problem comes from semiconductor manufacturing, when Advanced Process Control constraints are considered in scheduling problems, as for example in the photolithography area. To solve this problem, a Time Indexed Mixed Integer Linear Programming (MILP) model was proposed and solved in a previous paper. A new adapted model will be provided in this paper. A bicriteria objective function, that includes scheduling and qualification criteria, is considered. Dedicated heuristics are proposed. Numerical experiments are conducted to compare heuristic and exact solutions.

Published in:

Simulation Conference (WSC), Proceedings of the 2011 Winter

Date of Conference:

11-14 Dec. 2011