Scheduling on parallel dedicated machines with job rejection

Baruch Mor and Gur Mosheiov

International Journal of Production Research, 2024, vol. 62, issue 19, 6933-6940

Abstract: We study scheduling problems on parallel dedicated machines. Thus, each job can be processed on one specific machine only. The option of job-rejection is considered, and the total permitted rejection cost of all the jobs is bounded. Six scheduling problems are solved: ( $ i $ i) minimising makespan, ( $ ii $ ii) minimising makespan with release-dates, ( $ iii $ iii) minimising total completion time, ( $ iv $ iv) minimising total weighted completion time, ( $ v $ v) minimising total load, and ( $ vi $ vi) minimising maximum tardiness. Pseudo-polynomial dynamic programming algorithms are introduced for all these NP-hard problems.

Date: 2024
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1080/00207543.2024.2314714 (text/html)
Access to full text is restricted to subscribers.

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:taf:tprsxx:v:62:y:2024:i:19:p:6933-6940

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/TPRS20

DOI: 10.1080/00207543.2024.2314714

Access Statistics for this article

International Journal of Production Research is currently edited by Professor A. Dolgui

More articles in International Journal of Production Research from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().