A note on lot scheduling on a single machine to minimize maximum weighted tardiness

Mosheiov, Gur; Sarig, Assaf

doi:10.1007/s10878-023-01040-7

J Comb Optim

2023

DOI: 10.1007/s10878-023-01040-7

|View full text |Cite

A note on lot scheduling on a single machine to minimize maximum weighted tardiness

Gur Mosheiov

Assaf Sarig

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Mathematical Models and Optimal Algorithms for Lot Scheduling Considering Job Splitting and Due Dates in Green Logistics

Liu,

Zheng

et al. 2024

Asia Pac. J. Oper. Res.

View full text Add to dashboard Cite

Lot scheduling is a promising manufacturing mode in green logistics that can efficiently save energy and reduce production costs. It has been widely applied to integrate circuit tests in semiconductor factories, textile processing in garment workshops, etc. Each processing lot is of a fixed capacity and identical processing time, and completes more than one job simultaneously. Jobs with sizes and due dates are allowed to be arbitrarily split and processed in consecutive lots. They are delivered immediately upon completion. To the best of our knowledge, in the domain of lot scheduling, there exist no mathematical programming models that describe the above features simultaneously. In this work, we focus on the single machine environment and mainly consider two lot scheduling problems with the objectives of minimizing the maximum lateness and the total tardiness, respectively. For the problems, we first propose new mixed integer linear programming models (solved by commercial solvers), which enable a systematic understanding of the studied problems and serve as a mathematical programming basis for more complicated problems. We then prove that the Earliest Due-Date (EDD) first rule and the Shortest Processing Time (SPT) first rule can optimally solve the two problems, respectively, provided that the due dates and job sizes are agreeable, i.e., a later due date indicates a larger size of job. Experimental results show the efficiency of our methods and managerial insights are drawn.

show abstract

Mathematical Models and Optimal Algorithms for Lot Scheduling Considering Job Splitting and Due Dates in Green Logistics

Liu,

Zheng

et al. 2024

Asia Pac. J. Oper. Res.

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

hi@scite.ai

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

A note on lot scheduling on a single machine to minimize maximum weighted tardiness

Cited by 1 publication

References 9 publications

Mathematical Models and Optimal Algorithms for Lot Scheduling Considering Job Splitting and Due Dates in Green Logistics

Mathematical Models and Optimal Algorithms for Lot Scheduling Considering Job Splitting and Due Dates in Green Logistics

Contact Info

Product

Resources

About