A Multiple-Criterion Model for Machine Scheduling
Journal of Scheduling
Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Expert Systems with Applications: An International Journal
Branch-and-bound and simulated annealing algorithms for a two-agent scheduling problem
Expert Systems with Applications: An International Journal
A two-machine flowshop problem with two agents
Computers and Operations Research
Computers and Industrial Engineering
Scheduling two agents on uniform parallel machines with makespan and cost functions
Journal of Scheduling
Two-agent scheduling with learning consideration
Computers and Industrial Engineering
Solving a two-agent single-machine scheduling problem considering learning effect
Computers and Operations Research
Single-machine multi-agent scheduling problems with a global objective function
Journal of Scheduling
Two-Agent scheduling on an unbounded serial batching machine
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Genetic algorithms for a two-agent single-machine problem with release time
Applied Soft Computing
Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
Computers and Operations Research
Journal of Intelligent Manufacturing
Approximation schemes for two-machine flow shop scheduling with two agents
Journal of Combinatorial Optimization
A study of the single-machine two-agent scheduling problem with release times
Applied Soft Computing
A tabu method for a two-agent single-machine scheduling with deterioration jobs
Computers and Operations Research
Hi-index | 0.00 |
Baker and Smith [J. Scheduling, 6, 7---16, 2003] introduced a new model of scheduling in which there are two or more distinct families of jobs pursuing different objectives. Their contributions include two polynomial-time dynamic programming recursions, respectively, for the single machine scheduling with two families of jobs to minimize a positive combination of total weighted completion time, or maximum lateness, of the first family of jobs and maximum lateness of the second family of jobs. Unfortunately, these dynamic programming recursions are incorrect. In this paper, we solve the same problems by an O(n1 n2(n1 + n2)) time algorithm.