Two-agent single-machine scheduling with resource-dependent starting times

MaRDI QIDQ474145zbMATH OpenFDO

Authors Xiaoyu Tian, Peng Liu

Publication date 24 November 2014

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Review text

Summary: We consider several two-agent scheduling problems with resource consumption on a single machine, where each of the agents wants to minimize a measure dependent on its own jobs. The starting time of each job of the first agent is related to the amount of resource consumed. The objective is to minimize the total amount of resource consumption of the first agent with the restriction that the makespan or the total completion time of the second agent cannot exceed a given bound \(U\). The optimal properties and the optimal polynomial time algorithms are proposed to solve the scheduling problems.

Recommendations

• A note on two-agent scheduling with resource dependent release times on a single machine
• Two‐agent scheduling with linear resource‐dependent processing times
• Two-agent scheduling problems on a single-machine to minimize the total weighted late work
• Single machine scheduling problems with resource dependent release times
• Single machine scheduling with resource dependent release times and processing times

Cited in

(3)

• An improved genetic algorithm for single-machine inverse scheduling problem
• A note on two-agent scheduling with resource dependent release times on a single machine
• Two‐agent scheduling with linear resource‐dependent processing times

This page was built for publication: Two-agent single-machine scheduling with resource-dependent starting times

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