A note on the single machine CON and CONW problems with lot scheduling

Mor, Baruch; Mosheiov, Gur

doi:10.1007/s10878-021-00709-1

J Comb Optim

2021

DOI: 10.1007/s10878-021-00709-1

|View full text |Cite

A note on the single machine CON and CONW problems with lot scheduling

Baruch Mor

Gur Mosheiov

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2021

2025

Publication Types

Select...

Article5

Relationship

Self Cite0

Independent5

Authors

Journals

Cited by 7 publications

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Exploring the development trajectory of single-machine production scheduling

Ying,

Pourhejazy,

Huang

2024

Ann Oper Res

View full text Add to dashboard Cite

The Single-Machine Scheduling Problem (SMSP) serves as the cornerstone of scheduling theory. Almost all developments in production planning and control were initially introduced and tested within single-machine production settings. Exploring the literature on SMSPs illuminates the entire development trajectory of scheduling theory. This study employs the Main Path Analysis (MPA) for a systematic review that is the first of its kind in the literature on SMSPs. By analyzing 2904 articles, the main path and key branches that highlight the most significant documents in the development trajectory as well as the specifics in different development stages of the field are identified. The literature is analyzed in four stages of development, following a chronological order. Within this framework, the focus of the studies, key technologies, and characteristics of each period are discussed. Cluster and keyword analysis are employed alongside MPA to identify and explore the predominant themes in the field, including SMSPs with deterioration and/or learning effects, solution methods for SMSPs with various constraints, solving SMSPs integrated with maintenance-related variables and constraints, advanced solution methods and constructive heuristics for minimizing delays, as well as agent-based methods for single-machine scheduling. The review outcomes consist of directions for future research based on the development trajectories of SMSPs.

show abstract

Exploring the development trajectory of single-machine production scheduling

Ying,

Pourhejazy,

Huang

2024

Ann Oper Res

View full text Add to dashboard Cite

show abstract

Effective Heuristics and an Iterated Greedy Algorithm to Schedule Identical Parallel Machines Subject to Common Restrictive Due Windows

2021

View full text Add to dashboard Cite

Polynomial time algorithms to find Pareto optimal schedules of bicriteria lot scheduling problems with splitable jobs on a single parallel-batch machine

Shen,

Simic,

et al. 2025

Journal of Computational and Applied Mathematics

View full text Add to dashboard Cite

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

customersupport@researchsolutions.com

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

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

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 the single machine CON and CONW problems with lot scheduling

Cited by 7 publications

References 18 publications

Exploring the development trajectory of single-machine production scheduling

Exploring the development trajectory of single-machine production scheduling

Effective Heuristics and an Iterated Greedy Algorithm to Schedule Identical Parallel Machines Subject to Common Restrictive Due Windows

Polynomial time algorithms to find Pareto optimal schedules of bicriteria lot scheduling problems with splitable jobs on a single parallel-batch machine

Contact Info

Product

Resources

About