A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
Published 2016 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
Authors
Keywords
-
Journal
JOURNAL OF COMBINATORIAL OPTIMIZATION
Volume 33, Issue 4, Pages 1454-1468
Publisher
Springer Nature
Online
2016-06-29
DOI
10.1007/s10878-016-0049-1
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance
- (2016) Baruch Mor et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Minimizing maximum cost on a single machine with two competing agents and job rejection
- (2016) Baruch Mor et al. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
- Two-agent single-machine scheduling to minimize the weighted sum of the agents’ objective functions
- (2014) T.C.E. Cheng et al. COMPUTERS & INDUSTRIAL ENGINEERING
- Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan
- (2014) Kejun Zhao et al. JOURNAL OF COMBINATORIAL OPTIMIZATION
- Group scheduling and job-dependent due window assignment based on a common flow allowance
- (2013) Min Ji et al. COMPUTERS & INDUSTRIAL ENGINEERING
- Polynomial time solutions for scheduling problems on a proportionate flowshop with two competing agents
- (2013) B Mor et al. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
- Single machine just-in-time scheduling problems with two competing agents
- (2013) Enrique Gerstl et al. NAVAL RESEARCH LOGISTICS
- Scheduling problems with two competing agents to minimized weighted earliness–tardiness
- (2012) Enrique Gerstl et al. COMPUTERS & OPERATIONS RESEARCH
- Parallel machine scheduling problems with common flow-allowance
- (2012) Baruch Mor et al. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
- Solving a two-agent single-machine scheduling problem considering learning effect
- (2011) Der-Chiang Li et al. COMPUTERS & OPERATIONS RESEARCH
- Single machine batch scheduling with two competing agents to minimize total flowtime
- (2011) Baruch Mor et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Scheduling a maintenance activity and due-window assignment based on common flow allowance
- (2011) Baruch Mor et al. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
- Approximation schemes for two-machine flow shop scheduling with two agents
- (2011) Wenchang Luo et al. JOURNAL OF COMBINATORIAL OPTIMIZATION
- Unbounded parallel-batching scheduling with two competitive agents
- (2011) Shisheng Li et al. JOURNAL OF SCHEDULING
- Minmax scheduling problems with common flow-allowance
- (2011) B Mor et al. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
- A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations
- (2010) T.C.E. Cheng et al. COMPUTERS & INDUSTRIAL ENGINEERING
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
- (2010) Baruch Mor et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Single-machine scheduling of proportionally deteriorating jobs by two agents
- (2010) S Gawiejnowicz et al. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
- Competitive Two-Agent Scheduling and Its Applications
- (2009) Joseph Y.-T. Leung et al. OPERATIONS RESEARCH
- Due-date assignment on uniform machines
- (2007) Gur Mosheiov et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Find Funding. Review Successful Grants.
Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.
ExplorePublish scientific posters with Peeref
Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.
Learn More