Synchronisation of scarce resources for a parallel machine lotsizing problem

  • Almeder C
  • Almada-Lobo B
  • 21


    Mendeley users who have this article in their library.
  • 12


    Citations of this article.


In this paper we present a novel approach to tackle the synchronization of a secondary resource in lotsizing and scheduling problems. This kind of problem occurs in different manufacturing processes (e.g. wafer testing in the semiconductor industry, production and bottling of soft drinks). We consider a scenario of parallel unrelated machines which have to be equipped with a tool or need a special kind of resource for processing. Our approach allows tracing the assignment of these secondary resources across different machines and synchronizing their usage independently of time periods. We present extensions of the general lotsizing and scheduling problem and of the capacitated lotsizing problem. We prove that the latter model is a special case of the first one, but it performs computationally much better.

Author-supplied keywords

  • Lot sizing
  • Mixed integer linear Programming
  • Production planning
  • Scheduling

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Christian Almeder

  • Bernardo Almada-Lobo

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free