Mirror scheduling problems with early work and late work criteria

Xin Chen, Sergey Kovalev (), Małgorzata Sterna and Jacek Błażewicz
Additional contact information
Xin Chen: Liaoning University of Technology
Sergey Kovalev: INSEEC School of Business and Economics - INSEEC U. Research Center
Małgorzata Sterna: Institute of Computing Science
Jacek Błażewicz: Institute of Computing Science

Journal of Scheduling, 2021, vol. 24, issue 5, No 4, 483-487

Abstract: Abstract We give a definition of a class of mirror scheduling problems, review existing representatives of this class and demonstrate that an identical parallel machine scheduling problem with precedence constraints and an upper bound on the makespan to minimize (maximize) the total weighted early work and the same problem with modified due dates, reversed precedence constraints and the objective function of minimizing (maximizing) the total weighted late work are mirror problems.

Keywords: Single machine; Parallel machines; Late work; Early work; Mirror problems (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10951-020-00636-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jsched:v:24:y:2021:i:5:d:10.1007_s10951-020-00636-9

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-020-00636-9

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().