Two-agent single-machine scheduling of jobs with time-dependent processing times and ready times
From MaRDI portal
Publication:474643
DOI10.1155/2013/806325zbMATH Open1299.90151OpenAlexW2134630548WikidataQ59030238 ScholiaQ59030238MaRDI QIDQ474643FDOQ474643
Authors: Jan-Yee Kung, Yuan-Po Chao, Kuei-I Lee, Chao-Chung Kang, Win-Chin Lin 
Publication date: 24 November 2014
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/806325
Recommendations
- A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents
- Two-agent scheduling problems with the general position-dependent processing time
- A two-agent single-machine scheduling problem with learning and deteriorating considerations
- Two-agent scheduling of time-dependent jobs
- Scheduling two-agents with a time-dependent deterioration to minimize the minsum earliness measures
Cites Work
- Title not available (Why is that?)
- A multiple-criterion model for machine scheduling
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- Scheduling Problems with Two Competing Agents
- Single machine batch scheduling with two competing agents to minimize total flowtime
- A note on the scheduling with two families of jobs
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- A state-of-the-art review on scheduling with learning effects
- Scheduling Deteriorating Jobs on a Single Processor
- A note on the complexity of the problem of two-agent scheduling on a single machine
- Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan
- Single-machine group scheduling problems with deteriorated and learning effect
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
- Single-machine scheduling with learning considerations
- A concise survey of scheduling with time-dependent processing times
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
- Scheduling with time dependent processing times: Review and extensions
- An investigation on a two-agent single-machine scheduling problem with unequal release dates
- Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
- A dual algorithm for the one-machine scheduling problem
- A genetic algorithm for flow shop scheduling problems
- Two-agent scheduling with position-based deteriorating jobs and learning effects
- Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration
- Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times
- A due-date assignment problem with learning effect and deteriorating jobs
- SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING
- Improved genetic algorithm for the permutation flowshop scheduling problem.
- Due-window assignment and scheduling with multiple rate-modifying activities under the effects of deterioration and learning
Cited In (5)
- Title not available (Why is that?)
- Single machine scheduling with two competing agents and equal job processing times
- Title not available (Why is that?)
- Single machine just‐in‐time scheduling problems with two competing agents
- A genetic algorithm-based approach for single-machine scheduling with learning effect and release time
This page was built for publication: Two-agent single-machine scheduling of jobs with time-dependent processing times and ready times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q474643)
