Processing may take a few seconds...

Article


Title

Alternative algorithms for identical machines scheduling to maximize total early work with a common due date

Authors

[ 1 ] Instytut Informatyki, Wydział Informatyki i Telekomunikacji, Politechnika Poznańska | [ P ] employee

Scientific discipline (Law 2.0)

[2.3] Information and communication technology

Year of publication

2022

Published in

Computers & Industrial Engineering

Journal year: 2022 | Journal volume: vol. 171

Article type

scientific article

Publication language

english

Keywords
EN
  • Identical machines scheduling
  • Early work maximization
  • Common due date
  • Dynamic programming
  • Fully polynomial time approximation scheme
Abstract

EN We study a scheduling problem with a given number of identical parallel machines, a common job due date and the total early work criterion, i.e., P m|dj =d| max{X}, which is known to be NP-hard. A new dynamic programming algorithm is proposed, which is more efficient than the existing exact approach for this problem. Based on the proposed dynamic programming, we further design two new fully polynomial time approximation schemes. The effectiveness and efficiency of the new exact and pproximation approaches are validated in the computational experiments.

Date of online publication

01.07.2022

Pages (from - to)

108386-1 - 108386-9

DOI

10.1016/j.cie.2022.108386

URL

https://www.sciencedirect.com/science/article/abs/pii/S0360835222004296?via%3Dihub

Comments

Article Number: 108386

Points of MNiSW / journal

140.0

Impact Factor

5.431 [List 2020]

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.