• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - Request a copy

A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size

Aloulou, Mohamed Ali; Bouzaiene, Afef; Dridi, Najoua; Vanderpooten, Daniel (2014), A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size, Journal of Scheduling, 17, 1, p. 17-29. 10.1007/s10951-013-0340-2

Type
Article accepté pour publication ou publié
Date
2014
Journal name
Journal of Scheduling
Volume
17
Number
1
Publisher
Wiley
Pages
17-29
Publication identifier
10.1007/s10951-013-0340-2
Metadata
Show full item record
Author(s)
Aloulou, Mohamed Ali
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Bouzaiene, Afef

Dridi, Najoua

Vanderpooten, Daniel
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)
We consider the two-machine flow-shop serial-batching scheduling problem where the machines have a limited capacity in terms of the number of jobs. Two criteria are considered here. The first criterion is the number of batches to be minimized. This criterion reflects situations where processing of any batch induces a fixed cost, which leads to a total cost proportional to the number of batches. The second criterion is the makespan. This model is relevant in different production contexts, especially when considering joint production and inbound delivery scheduling. We study the complexity of the problem and propose two polynomial-time approximation algorithms with a guaranteed performance. The effectiveness of these algorithms is evaluated using numerical experiments. Exact polynomial-time algorithms are also provided for some particular cases.
Subjects / Keywords
Makespan; Batching cost; Two-machine flow-shop; Serial batching; Bounded batch size

Related items

Showing items related by title and author.

  • Thumbnail
    The two-machine flow-shop serial-batching scheduling problem with limited batch size 
    Bouzaiene, Afef; Aloulou, Mohamed Ali; Dridi, Najoua; Vanderpooten, Daniel (2010) Communication / Conférence
  • Thumbnail
    A bicriteria flow-shop scheduling problem with two serial batching machines 
    Bouzaiene, Afef; Aloulou, Mohamed Ali; Dridi, Najoua; Vanderpooten, Daniel (2010) Communication / Conférence
  • Thumbnail
    Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case 
    Aloulou, Mohamed Ali; Artigues, Christian (2010) Article accepté pour publication ou publié
  • Thumbnail
    Minmax regret 1-center problem on a network with a discrete set of scenarios 
    Kalaï, Rim; Aloulou, Mohamed Ali; Vallin, Philippe; Vanderpooten, Daniel (2006) Document de travail / Working paper
  • Thumbnail
    The complexity of single machine scheduling problems under scenario-based uncertainty 
    Della Croce, Federico; Aloulou, Mohamed Ali (2008) Chapitre d'ouvrage
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo