Two-Agent Scheduling to Minimize the Maximum Cost with Position-Dependent Jobs
This paper investigates a single-machine two-agent scheduling problem to minimize the maximum costs with position-dependent jobs. There are two agents, each with a set of independent jobs, competing to perform their jobs on a common machine. In our scheduling setting, the actual position-dependent p...
Main Author: | Long Wan |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2015-01-01
|
Series: | Discrete Dynamics in Nature and Society |
Online Access: | http://dx.doi.org/10.1155/2015/932680 |
Similar Items
-
Minimizing Tardiness Penalty Costs in Job Shop Scheduling Under Maximum Allowable Tardiness
by: Jae-Gon Kim, et al.
Published: (2020-11-01) -
On the Dual and Inverse Problems of Scheduling Jobs to Minimize the Maximum Penalty
by: Alexander A. Lazarev, et al.
Published: (2020-07-01) -
A single machine scheduling to minimize the total completion time and maximum tardiness with two agents
by: Zong-Ren Huang, et al.
Published: (2011) -
Two Stage Hybrid Flow Shop Scheduling with Job Splitting Property for Minimizing the Maximum Completion Time
by: Shao-wei Huang, et al.
Published: (2014) -
Two-machine flowshop scheduling to minimize the number of tardy jobs
by: Wan-Ling Shie, et al.
Published: (2004)