Two-agent scheduling problems with the general position-dependent processing time

DOI10.1016/J.TCS.2019.08.023MaRDI QIDQ2333788zbMATH OpenOpenAlexWikidataFDO

Authors Li-Ya Yang, Xiwen Lu

Publication date 13 November 2019

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2019.08.023

zbMATH Keywords

approximation algorithmdeteriorating effectlearning effectposition-dependent scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Two-agent scheduling to minimize the maximum cost with position-dependent jobs
• Approximation algorithms for some position-dependent scheduling problems
• Two-agent scheduling of time-dependent jobs
• Two-agent scheduling with position-based deteriorating jobs and learning effects
• Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine

Cites work

• A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
• Flow shop scheduling jobs with position-dependent processing times
• Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms
• Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
• Multiagent scheduling. Models and algorithms
• On single processor scheduling problems with learning dependent on the number of processed jobs
• Scheduling Deteriorating Jobs on a Single Processor
• Scheduling jobs with position-dependent processing times
• Scheduling on parallel processors with varying processing times
• Scheduling problems with position dependent job processing times: computational complexity results
• Scheduling with state-dependent machine speed
• Single-machine scheduling with two competing agents and learning consideration
• Techniques for scheduling with rejection
• Two-agent single-machine scheduling problems under increasing linear deterioration
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

Cited in

(8)

• Multi-machine scheduling with interval constrained position-dependent processing times
• Two-agent scheduling to minimize the maximum cost with position-dependent jobs
• Approximation algorithms for some position-dependent scheduling problems
• Two-agent single-machine scheduling of jobs with time-dependent processing times and ready times
• A generalized two-agent location problem: Asymmetric dynamics and coordination
• Two-agent scheduling with time-dependent and position-dependent in a flow-shop system
• Minimizing the number of tardy jobs with generalized due-dates and position-dependent processing times
• The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times

This page was built for publication: Two-agent scheduling problems with the general position-dependent processing time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2333788)