Skip to main content
SpringerLink
Log in

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

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

This paper studies the scheduling of lots (jobs) of different product types (job family) on parallel machines, where not all machines are able to process all job families (non-identical machines). A special time constraint, associated to each job family, should be satisfied for a machine to remain qualified for processing a job family. This constraint imposes that the time between the executions of two consecutive jobs of the same family on a qualified machine must not exceed the time threshold of the family. Otherwise, the machine becomes disqualified. This problem comes from semiconductor manufacturing, when Advanced Process Control constraints are considered in scheduling problems. To solve this problem, two Mixed Integer Linear Programming models are proposed that use different types of variables. Numerical experiments show that the second model is much more effective, and that there is a trade-off between optimizing the scheduling objective and maximizing the number of machines that remain qualified for the job families. Two heuristics are also presented and studied in the numerical experiments.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  • Detienne, B., Dauzère-Pérès, S., & Yugma, C. (2011). Scheduling jobs on parallel machines to minimize a regular step total cost function. Journal of Scheduling, 14(6), 523–538.

    Article  Google Scholar 

  • Kubiak, W., Lou, S. X. C., & Wang, Y. (1996). Mean flow time minimization in reentrant job shops with a hub. Operations Research, 44, 764–776.

    Article  Google Scholar 

  • Kumar, P. R. (1996). Re-entrant lines. Queuing Networks, 13, 87–110.

    Article  Google Scholar 

  • Li, L., & Qiao, F. (2008). The impact of the qual-run requirements of APC on the scheduling performance in semiconductor manufacturing. In 4th IEEE conference on automation science and engineering (pp. 242–246).

    Google Scholar 

  • Moench, L., Fowler, J. W., Dauzère-Pérès, S., Mason, S. J., & Rose, O. (2011). A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations. Journal of Scheduling, 14(6), 583–599.

    Article  Google Scholar 

  • Musacchio, J., Rangan, S., Spanos, C., & Poolla, K. (1997). On the utility of run to run control in semiconductor manufacturing. In IEEE international symposium on semiconductor manufacturing (ISSM 1997) (pp. D9–D12).

    Google Scholar 

  • Yiwei, C., Kutanoglu, E., Hasenbein, J., & Qin, J. (2010). Single-machine scheduling with advanced process control constraints. Journal of Scheduling, 1–15.

  • Webster, S. T. (1997). The complexity of scheduling job families about a common due date. Operations Research Letters, 2, 65–74.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. École des Mines de Saint-Etienne, Centre Microélectronique de Provence, 880 Avenue de Mimet, 13541, Gardanne, France

    Ali Obeid, Stéphane Dauzère-Pérès & Claude Yugma

Authors
  1. Ali Obeid
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stéphane Dauzère-Pérès
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Claude Yugma
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ali Obeid.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Obeid, A., Dauzère-Pérès, S. & Yugma, C. Scheduling job families on non-identical parallel machines with time constraints. Ann Oper Res 213, 221–234 (2014). https://doi.org/10.1007/s10479-012-1107-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-012-1107-4

Keywords

Search

Navigation