Mathematical Programming and Heuristics for Scheduling Problems with Early and Tardy Penalties - Université Polytechnique des Hauts-de-France Access content directly
Book Sections Year : 2013

Mathematical Programming and Heuristics for Scheduling Problems with Early and Tardy Penalties

Abstract

The just-in-time concept was developed in Japan in the Toyota factory with the principal aim of eliminating waste at all levels. The importance of this method has resulted in the analysis of a wide range of scheduling problems within manufacturing. This chapter examines one such problem of minimizing early and tardy penalties on a machine. A section examines some specific examples of this type of scheduling problem and introduces three important properties for characterizing an optimal solution of the problem. Another section discusses several mathematical models for this problem and performs a comparative computational study on benchmark instances. This followed by separate sections that describe several existing heuristics for quickly generating a feasible solution to the problem and examine a range of metaheuristics proposed in the literature to obtain high-quality solutions. The final section presents conclusions and suggestions for future research concerning the problem.
No file

Dates and versions

hal-03517836 , version 1 (08-01-2022)

Identifiers

Cite

Mustapha Ratli, Rachid Benmansour, Rita Macedo, Said Hanafi, Christophe Wilbaut. Mathematical Programming and Heuristics for Scheduling Problems with Early and Tardy Penalties. Jarboui, Bassem; Siarry, Patrick; Teghem, Jacques. Metaheuristics for Production Scheduling, John Wiley & Sons, Inc., pp.183-223, 2013, 978-1-84821-497-2. ⟨10.1002/9781118731598.ch8⟩. ⟨hal-03517836⟩
27 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More