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...
Saved in:
Main Author: | Long Wan |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2015-01-01
|
Series: | Discrete Dynamics in Nature and Society |
Online Access: | http://dx.doi.org/10.1155/2015/932680 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Two Parallel Machines Scheduling with Two-Vehicle Job Delivery to Minimize Makespan
by: Lisi Cao, et al.
Published: (2020-01-01) -
Improving the job shop scheduling algorithm to minimize total penalty costs considering maintenance activity
by: Puryani Puryani, et al.
Published: (2024-12-01) -
Single-Machine Scheduling to Minimize Total Completion Time and Tardiness with Two Competing Agents
by: Wen-Chiung Lee, et al.
Published: (2014-01-01) -
Scheduling Jobs and a Variable Maintenance on a Single Machine with Common Due-Date Assignment
by: Long Wan
Published: (2014-01-01) -
A Note on Two-Agent Scheduling with Resource Dependent Release Times on a Single Machine
by: Peng Liu, et al.
Published: (2015-01-01)