An optimal scheduling algorithm on single-machine with two-agent and deteriorating jobs

MaRDI QIDQ2951381zbMATH OpenFDO

Authors Yuelei Liu, Xiaodong Ren, Zuren Feng

Publication date 6 January 2017

zbMATH Keywords

deteriorating jobsscheduling problemsingle-machinetwo agents

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Deterministic scheduling theory in operations research (90B35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
• Single machine two-agent scheduling with deteriorating jobs
• Two-agent scheduling with linear-deteriorating jobs and release dates on a single machine
• A single-machine scheduling problem with two-agent and deteriorating jobs
• Two-agent single-machine scheduling problems under increasing linear deterioration

Cited in

(6)

• A decomposition-based two-stage optimization algorithm for single machine scheduling problems with deteriorating jobs
• A single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithms
• ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost
• A tabu method for a two-agent single-machine scheduling with deterioration jobs
• Two-agent scheduling with position-based deteriorating jobs and learning effects
• Two-agent single-machine scheduling problems under increasing linear deterioration

This page was built for publication: An optimal scheduling algorithm on single-machine with two-agent and deteriorating jobs

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