Some Single-Machine Scheduling Problems with Learning Effects and Two Competing Agents
This study considers a scheduling environment in which there are two agents and a set of jobs, each of which belongs to one of the two agents and its actual processing time is defined as a decreasing linear function of its starting time. Each of the two agents competes to process its respective jobs...
Saved in:
| Main Authors: | Hongjie Li, Zeyuan Li, Yunqiang Yin |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | The Scientific World Journal |
| Online Access: | http://dx.doi.org/10.1155/2014/471016 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Some Generalized Forms of Fuzzy Interval Valued Hyperideals in a Hyperring
by: Hongjie Li, et al.
Published: (2014-01-01) -
Two-Agent Single Machine Order Acceptance Scheduling Problem to Maximize Net Revenue
by: Jiaji Li, et al.
Published: (2021-01-01) -
A Single-Machine Two-Agent Scheduling Problem by a Branch-and-Bound and Three Simulated Annealing Algorithms
by: Shangchia Liu, et al.
Published: (2015-01-01) -
MINIMIZING MEAN FLOW TIME FOR THE TWO-MACHINE SCHEDULING PROBLEM WITH A SINGLE SERVER
by: F. Werner, et al.
Published: (2016-10-01) -
Two Parallel-Machine Scheduling Problems with Function Constraint
by: Chia-Lun Hsu, et al.
Published: (2020-01-01)