Minimizing Total Weighted Completion Times for Semi-online Single Machine Scheduling - Université de Lorraine Access content directly
Conference Papers Year : 2020

Minimizing Total Weighted Completion Times for Semi-online Single Machine Scheduling

Abstract

This paper addresses the semi-online scheduling problem for total weighted completion time minimization on a single machine, where a combination of information on jobs’ release dates and processing times is considered. In this study, jobs can only arrive at known future times and a lower bound on jobs’ processing times is known in advance. A new semi-online algorithm, called MCSWPT (Modified Critical Shortest Weighted Processing Time), that makes use of the available pieces of information in order to produce better schedules compared to its online peers is presented. A numerical analysis is presented, showing the impact of having the considered partial information.
No file

Dates and versions

hal-04084540 , version 1 (28-04-2023)

Identifiers

Cite

Hajar Nouinou, T. Arbaoui, A. Yalaoui. Minimizing Total Weighted Completion Times for Semi-online Single Machine Scheduling. 10th IFAC CONFERENCE ON MANUFACTURING MODELLING, MANAGEMENT AND CONTROL, Jun 2022, Nantes, France. pp.1054-1066, ⟨10.1007/978-3-030-21803-4_104⟩. ⟨hal-04084540⟩
10 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More