Single machine lot scheduling with maintenance activity

Baruch Mor, Gur Mosheiov () and Dana Shapira
Additional contact information
Baruch Mor: Ariel University, Department of Economics and Business Administration
Gur Mosheiov: The Hebrew University, School of Business Administration
Dana Shapira: Ariel University, Department of Computer Science

Journal of Combinatorial Optimization, 2025, vol. 50, issue 5, No 4, 22 pages

Abstract: Abstract We study a single-machine lot scheduling problem. In this setting, the producer receives orders of different sizes that should be processed in lots. The total size of the orders assigned to a specific lot cannot exceed its capacity, and order splitting is permitted. The processing times of the lots are identical. Moreover, we assume that a fixed maintenance activity is performed, and during the maintenance time, no production is feasible. The objective function is the minimum total weighted completion times of the orders. An extension in two directions is also studied. The first is optional job rejection, in which the scheduler has the option to process only a subset of the orders. The other orders are rejected, and the scheduler is penalized accordingly. The objective function remains total weighted completion time, subject to an upper bound on the total permitted rejection cost. The second extension is rate-modifying maintenance, in which the production rate is improved when the system resumes. Pseudo-polynomial dynamic programming solution algorithms are introduced for these NP-hard problems. Large-size instances are shown to be solved efficiently.

Keywords: Scheduling; Sequencing; Combinatorial optimization; Dynamic programming; Maintenance (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-025-01365-5 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:jcomop:v:50:y:2025:i:5:d:10.1007_s10878-025-01365-5

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-025-01365-5

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

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