scholarly journals Single machine batch processing problem with release dates to minimize total completion time

2018 ◽  
pp. 331-348 ◽  
Author(s):  
Pedram Beldar ◽  
Antonio Costa
Keyword(s):  
Single Machine ◽  
Completion Time ◽  
Batch Processing ◽  
Total Completion Time ◽  
Release Dates ◽  
Processing Problem

Heuristics for Minimizing Total Completion Time on Single Machine with Release Time

2007 ◽  
Vol 18-19 ◽  
pp. 347-352 ◽  
Author(s):  
Elkanah Oyetunji ◽  
Ayodeji E. Oluleye
Keyword(s):  
Approximation Algorithm ◽  
Single Machine ◽  
Industrial Production ◽  
Completion Time ◽  
Service Sector ◽  
Total Completion Time ◽  
Release Time ◽  
Release Dates ◽  
The Best Approximation ◽  
Better Than

This paper focuses on the problem of scheduling n jobs with release dates on a single machine in order to minimize the total completion time. Since the problem has been characterized as strongly NP-hard, two heuristics (HR1 and AEO) were proposed for solving the problem in polynomial time. The heuristics were compared with the best approximation algorithm for this problem to date (Best-alpha). Experimental results show that AEO performed better than the Bestalpha algorithm (selected from the literature) when the number of jobs (n) exceeds 5. This observation should prove useful in the operational dispatch of jobs in industrial production settings as well as the service sector.

scholarly journals Single-machine total completion time scheduling with a time-dependent deterioration

2011 ◽  
Vol 35 (3) ◽  
pp. 1506-1511 ◽  
Author(s):  
Ji-Bo Wang ◽  
Lin-Hui Sun ◽  
Lin-Yan Sun
Keyword(s):  
Single Machine ◽  
Completion Time ◽  
Time Dependent ◽  
Total Completion Time ◽  
Time Scheduling
Sign in / Sign up

Export Citation Format

Share Document