A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times

Authors:
Mohammad Mahdavi Mazdeh;Mansoor Sarhadi;Khalil S. Hindi
Affiliations:
Department of Design and Systems Engineering, Brunel University, Uxbridge, Middlesex, UK;Department of Design and Systems Engineering, Brunel University, Uxbridge, Middlesex, UK;Faculty of Engineering and Architecture and the School of Business, American University of Beirut (AUB), P.O. BOX 11-0236, Riad El Solh, Beirut 1107 2020, Lebanon
Venue:
Computers and Operations Research
Year:
2008

Citing 5
Cited 4

Scheduling with release dates on a single machine to minimize total weighted completion time

Discrete Applied Mathematics
Supply chain scheduling: Batching and delivery

Operations Research
Two Machine Scheduling under Disruptions with Transportation Considerations

Journal of Scheduling
A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times

Computers and Operations Research
Efficient heuristics to minimize total flow time with release dates

Operations Research Letters

A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times

Computers and Operations Research
A novel genetic algorithm for solving production and transportation scheduling in a two-stage supply chain

Computers and Industrial Engineering
A genetic algorithm for minimizing total tardiness/earliness of weighted jobs in a batched delivery system

Computers and Industrial Engineering
Single machine batch scheduling with release times and delivery costs

Journal of Scheduling

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper addresses scheduling a set of jobs with specified release times on a single machine for delivery in batches to customers or to other machines for further processing. This problem is a natural extension of minimizing the sum of flow times in the presence of release time by considering the possibility of delivering jobs in batches and introducing batch delivery costs. The scheduling objective adopted is that of minimizing the sum of flow times and delivery costs. The extended problem arises in the context of coordination between machine scheduling and a distribution system in a supply chain network. Structural properties of the problem are investigated and used to devise a branch-and-bound solution scheme. Computational experiments show significant improvement over an existing dynamic programming algorithm.