Single machine lot scheduling with non-uniform lot capacities and processing times

Ying Chen (), Yongxi Cheng () and Guiqing Zhang ()
Additional contact information
Ying Chen: Xi’an Jiaotong University
Yongxi Cheng: Xi’an Jiaotong University
Guiqing Zhang: Xi’an Jiaotong University

Journal of Combinatorial Optimization, 2022, vol. 43, issue 5, No 19, 1359-1367

Abstract: Abstract In this paper, we investigate the single machine lot scheduling problem in which each lot contains one or more jobs (or part of jobs). Jobs with different sizes are splittable and should be processed in consecutive lots. Any completed (part of a) job is delivered to the customer on its completion. We generalize the problem studied in Zhang et al. (Inf Process Lett 142:46–51, 2019) such that lots may have different capacities and processing times, and the sizes of jobs are unbounded. We show that for this generalized case, the WSPT (Weighted Shortest Processing Time first) rule is still optimal for both minimizing total weighted completion time and minimizing total weighted discounted completion time.

Keywords: Algorithms; Lot scheduling; Single machine; WSPT rule (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-020-00654-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:43:y:2022:i:5:d:10.1007_s10878-020-00654-5

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

DOI: 10.1007/s10878-020-00654-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 ().