A two-machine flowshop problem with two agents

Authors:
Wen-Chiung Lee;Shiuan-Kang Chen;Cheng-Wei Chen;Chin-Chia Wu
Affiliations:
Department of Statistics, Feng Chia University, Taichung, Taiwan;Department of Statistics, Feng Chia University, Taichung, Taiwan;Department of Statistics, Feng Chia University, Taichung, Taiwan;Department of Statistics, Feng Chia University, Taichung, Taiwan
Venue:
Computers and Operations Research
Year:
2011

Citing 12
Cited 9

On games corresponding to sequencing situations with ready times

Mathematical Programming: Series A and B
Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n/2/F/ F

Journal of the ACM (JACM)
Minimizing Total Completion Time in a Two-Machine

Mathematics of Operations Research
A Multiple-Criterion Model for Machine Scheduling

Journal of Scheduling
Scheduling Problems with Two Competing Agents

Operations Research
A note on the scheduling with two families of jobs

Journal of Scheduling
Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs

Theoretical Computer Science
Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Minimizing total completion time in two-machine flow shops with exact delays

Computers and Operations Research
Approximation algorithms for multi-agent scheduling to minimize total weighted completion time

Information Processing Letters
A Lagrangian approach to single-machine scheduling problems with two competing agents

Journal of Scheduling
Competitive Two-Agent Scheduling and Its Applications

Operations Research

A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations

Computers and Industrial Engineering
Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties

Information Sciences: an International Journal
Genetic algorithms for a two-agent single-machine problem with release time

Applied Soft Computing
Scheduling problems with two competing agents to minimized weighted earliness-tardiness

Computers and Operations Research
Two-agent singe-machine scheduling with release times to minimize the total weighted completion time

Computers and Operations Research
Ant colony algorithms for a two-agent scheduling with sum-of processing times-based learning and deteriorating considerations

Journal of Intelligent Manufacturing
A branch-and-bound procedure for a single-machine earliness scheduling problem with two agents

Applied Soft Computing
Single machine scheduling with interfering job sets

Computers and Operations Research
Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects

Information Sciences: an International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

The multiple-agent scheduling problems have received increasing attention recently. However, most of the research focuses on deriving feasible/optimal solutions or examining the computational complexity of the intractable cases in a single machine. Often a number of operations have to be done on every job in many manufacturing and assembly facilities (Pinedo, 2002 [1]). In this paper, we consider a two-machine flowshop problem where the objective is to minimize the total completion time of the first agent with no tardy jobs for the second agent. We develop a branch-and-bound algorithm and simulated annealing heuristic algorithms to search for the optimal solution and near-optimal solutions for the problem, respectively.