Two-agent single-machine scheduling of jobs with time-dependent processing times and ready times

DOI10.1155/2013/806325MaRDI QIDQ474643zbMATH OpenOpenAlexWikidataFDO

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

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

• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• A concise survey of scheduling with time-dependent processing times
• A dual algorithm for the one-machine scheduling problem
• A due-date assignment problem with learning effect and deteriorating jobs
• A genetic algorithm for flow shop scheduling problems
• A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
• A multiple-criterion model for machine scheduling
• A note on the complexity of the problem of two-agent scheduling on a single machine
• A note on the scheduling with two families of jobs
• A state-of-the-art review on scheduling with learning effects
• An investigation on a two-agent single-machine scheduling problem with unequal release dates
• Due-window assignment and scheduling with multiple rate-modifying activities under the effects of deterioration and learning
• Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times
• Improved genetic algorithm for the permutation flowshop scheduling problem.
• Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
• Multi-agent scheduling on a single machine with max-form criteria
• Multi-agent single machine scheduling
• SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING
• Scheduling Deteriorating Jobs on a Single Processor
• Scheduling Problems with Two Competing Agents
• Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
• Scheduling with time dependent processing times: Review and extensions
• Single machine batch scheduling with two competing agents to minimize total flowtime
• Single-machine group scheduling problems with deteriorated and learning effect
• Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration
• Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan
• Single-machine scheduling with learning considerations
• Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
• Two-agent scheduling with position-based deteriorating jobs and learning effects

Cited in

(5)

• scientific article; zbMATH DE number 7113489 (Why is no real title available?)
• Single machine scheduling with two competing agents and equal job processing times
• scientific article; zbMATH DE number 6531341 (Why is no real title available?)
• 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)