Two-agent scheduling on a single parallel-batching machine to minimize the weighted sum of the agents’ makespans
Published 2018 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
Two-agent scheduling on a single parallel-batching machine to minimize the weighted sum of the agents’ makespans
Authors
Keywords
Two-agent scheduling, Parallel-batching machine, Makespan, Lower bound, Approximation algorithm, Worst-case ratio
Journal
Journal of Ambient Intelligence and Humanized Computing
Volume -, Issue -, Pages -
Publisher
Springer Nature
Online
2018-03-07
DOI
10.1007/s12652-018-0741-3
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
- (2017) Jun-Qiang Wang et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Adaptive service composition in an ambient environment with a multi-agent system
- (2017) Aouatef Chaib et al. Journal of Ambient Intelligence and Humanized Computing
- Cyber physical systems design, methodology, and integration: the current status and future outlook
- (2017) Ashraf Darwish et al. Journal of Ambient Intelligence and Humanized Computing
- Schedule-based execution bottleneck identification in a job shop
- (2016) Jun-Qiang Wang et al. COMPUTERS & INDUSTRIAL ENGINEERING
- A two-agent single-machine scheduling problem to minimize the total cost with release dates
- (2015) Du-Juan Wang et al. SOFT COMPUTING
- 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
- Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria
- (2014) Stanisław Gawiejnowicz et al. COMPUTERS & OPERATIONS RESEARCH
- A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
- (2013) Qi Feng et al. APPLIED MATHEMATICAL MODELLING
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: Multi-agent scheduling problems
- (2013) Paz Perez-Gonzalez et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents
- (2013) Wen-Hung Wu et al. Journal of Industrial and Management Optimization
- Tight absolute bound for First Fit Decreasing bin-packing: FFD ( L ) ⩽ 11 / 9 OPT ( L ) + 6 / 9
- (2013) György Dósa et al. THEORETICAL COMPUTER SCIENCE
- Agents based multi-criteria decision-aid
- (2013) Alba Amato et al. Journal of Ambient Intelligence and Humanized Computing
- Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
- (2012) T.C.E. Cheng et al. COMPUTERS & OPERATIONS RESEARCH
- Bounded parallel-batching scheduling with two competing agents
- (2012) B. Q. Fan et al. JOURNAL OF SCHEDULING
- Approximation schemes for two-agent scheduling on parallel machines
- (2012) Kejun Zhao et al. THEORETICAL COMPUTER SCIENCE
- Two-agent scheduling to minimize the total cost
- (2011) Q.Q. Nong et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Single machine batch scheduling with two competing agents to minimize total flowtime
- (2011) Baruch Mor et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Unbounded parallel-batching scheduling with two competitive agents
- (2011) Shisheng Li et al. JOURNAL OF SCHEDULING
- Optimal methods for batch processing problem with makespan and maximum lateness objectives
- (2009) M.T. Yazdani Sabouni et al. APPLIED MATHEMATICAL MODELLING
- A Lagrangian approach to single-machine scheduling problems with two competing agents
- (2009) Alessandro Agnetis et al. JOURNAL OF SCHEDULING
- Competitive Two-Agent Scheduling and Its Applications
- (2009) Joseph Y.-T. Leung et al. OPERATIONS RESEARCH
- Agents and ambient intelligence: case studies
- (2009) Dante I. Tapia et al. Journal of Ambient Intelligence and Humanized Computing
Find Funding. Review Successful Grants.
Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.
ExploreAdd your recorded webinar
Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.
Upload Now