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

Authors:
Yunqiang Yin;Chin-Chia Wu;Wen-Hsiang Wu;Chou-Jung Hsu;Wen-Hung Wu
Affiliations:
State Key Laboratory Breeding Base of Nuclear Resources and Environment, East China Institute of Technology, Nanchang, Jiangxi 330013, China and School of Mathematics and Information Sciences, Eas ...;Department of Statistics, Feng Chia University, Taichung, Taiwan;Department of Healthcare Management, Yuanpei University, Hsinchu, Taiwan;Department of Industrial Engineering and Management, Nan Kai College, Nantou, Taiwan;Department of Business Administration, Kang-Ning Junior College, Taipei, Taiwan
Venue:
Applied Soft Computing
Year:
2013

Citing 17
Cited 1

Sequencing with earliness and tardiness penalties: a review

Operations Research
Scheduling Algorithms

Scheduling Algorithms
A Multiple-Criterion Model for Machine Scheduling

Journal of Scheduling
Scheduling Problems with Two Competing Agents

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

Theoretical Computer Science
Heuristic algorithms for solving the maximum lateness scheduling problem with learning considerations

Computers and Industrial Engineering
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
A two-machine flowshop problem with two agents

Computers and Operations Research
Simulated annealing algorithm with adaptive neighborhood

Applied Soft Computing
A simulated annealing-based optimal threshold determining method in edge-based segmentation of grayscale images

Applied Soft Computing
A note on the learning effect in multi-agent optimization

Expert Systems with Applications: An International Journal
A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations

Computers and Industrial Engineering
A simulated annealing method based on a specialised evolutionary algorithm

Applied Soft Computing
Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties

Information Sciences: an International Journal
An investigation on a two-agent single-machine scheduling problem with unequal release dates

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 tabu method for a two-agent single-machine scheduling with deterioration jobs

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses a two-agent scheduling problem on a single machine where the objective is to minimize the total weighted earliness cost of all jobs, while keeping the earliness cost of one agent below or at a fixed level Q. A mixed-integer programming (MIP) model is first formulated to find the optimal solution which is useful for small-size problem instances. To solve medium- to large-size problem instances, a branch-and-bound algorithm incorporating with several dominance properties and a lower bound is then provided to derive the optimal solution. A simulated annealing heuristic algorithm incorporating with a heuristic procedure is developed to derive the near-optimal solutions for the problem. A computational experiment is also conducted to evaluate the performance of the proposed algorithms.