An improved branch-and-bound algorithm for the two machine total completion time flow shop problem

2002 ◽  
Vol 139 (2) ◽  
pp. 293-301 ◽  
Author(s):  
F. Della Croce ◽  
M. Ghirardi ◽  
R. Tadei
Keyword(s):  
Branch And Bound ◽  
Completion Time ◽  
Flow Shop ◽  
Branch And Bound Algorithm ◽  
Total Completion Time ◽  
Time Flow ◽  
Flow Shop Problem

scholarly journals A matheuristic approach for the two-machine total completion time flow shop problem

2011 ◽  
Vol 213 (1) ◽  
pp. 67-78 ◽  
Author(s):  
Federico Della Croce ◽  
Andrea Grosso ◽  
Fabio Salassa
Keyword(s):  
Completion Time ◽  
Flow Shop ◽  
Total Completion Time ◽  
Time Flow ◽  
Flow Shop Problem

The two-machine total completion time flow shop problem

1996 ◽  
Vol 90 (2) ◽  
pp. 227-237 ◽  
Author(s):  
F. Della Croce ◽  
V. Narayan ◽  
R. Tadei
Keyword(s):  
Completion Time ◽  
Flow Shop ◽  
Total Completion Time ◽  
Time Flow ◽  
Flow Shop Problem

Bicriteria Scheduling on a Single Batching Machine with Transportation and Deterioration to Minimize Total Completion Time and Production Costs

2017 ◽  
Vol 34 (03) ◽  
pp. 1740014 ◽  
Author(s):  
Hua Gong ◽  
Ermei Zhang ◽  
Fang Liu
Keyword(s):  
Branch And Bound ◽  
Exposure Time ◽  
General Problem ◽  
Completion Time ◽  
Production Costs ◽  
Branch And Bound Algorithm ◽  
Total Completion Time ◽  
Inventory Level ◽  
Pareto Optimal ◽  
Batching Machine

In this paper, we consider a coordinated scheduling problem on a single batching machine with transportation and deterioration. The jobs are transported by a vehicle to the single batching machine for further processing. The processing time of a job is a step increasing function of its exposure time which is equivalent to the time interval from the beginning of the transportation to the starting of the job on the machine. The objective is to find Pareto-optimal schedules with two performance criteria (total completion time and the number of batches) to balance the inventory level and the production costs. We prove that the general problem is strongly NP-hard. We further develop polynomial-time algorithms for two special cases with a fixed job sequence and without exposure time limit, respectively. For the general problem, we develop a heuristic algorithm and a branch and bound algorithm. Computational experiments show that the heuristic algorithms perform well on randomly generated problem instances, and the branch and bound algorithm can obtain Pareto-optimal solutions for the small-scaled instances.

Sign in / Sign up

Export Citation Format

Share Document