A BATCHING PROBLEM WITH LEARNING EFFECT CONSIDERATIONS

Consider a batch-sizing problem, where all jobs are identical or similar, and a unit processing time (p = 1) is specified for each job. To minimize the total completion time of jobs, partitioning jobs into batches may be necessary. Learning effect from setup repetition makes small-sized batches; on the contrary, job's learning effect results in large-sized batches. With their collaborative influence, we develop a forward dynamic programming (DP) algorithm to determine the optimal number of batches and their optimal integer sizes. The computation effort required by this DP algorithm is a polynomial function of job size.

Download Full-text

Minimization of the total completion time for a single scheduling with learning effect and setup times consideration

Industrial Electronics and Engineering ◽

10.2495/iciee140841 ◽

2014 ◽

Author(s):

Yuling Yeh ◽

Chinyao Low ◽

Wen-Yi Lin

Keyword(s):

Completion Time ◽

Learning Effect ◽

Setup Times ◽

Total Completion Time

Download Full-text

Tabu search algorithms for minimizing total completion time on a single machine with an actual time-dependent learning effect

Natural Computing ◽

10.1007/s11047-016-9539-4 ◽

2016 ◽

Vol 18 (2) ◽

pp. 287-299

Author(s):

Chunhui Zheng ◽

Huaping Chen ◽

Rui Xu

Keyword(s):

Tabu Search ◽

Single Machine ◽

Completion Time ◽

Learning Effect ◽

Search Algorithms ◽

Time Dependent ◽

Total Completion Time ◽

Actual Time ◽

Dependent Learning

Download Full-text

Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs

International Journal of Systems Science ◽

10.1080/00207721.2010.542837 ◽

2012 ◽

Vol 43 (5) ◽

pp. 861-868 ◽

Cited By ~ 44

Author(s):

Ji-Bo Wang ◽

Ming-Zheng Wang ◽

Ping Ji

Keyword(s):

Single Machine ◽

Completion Time ◽

Learning Effect ◽

Deteriorating Jobs ◽

Time Dependent ◽

Total Completion Time ◽

Time Minimization ◽

Dependent Learning

Download Full-text

A Bicriteria Scheduling Problem with a Learning Effect: Total Completion Time and Total Tardiness

INFOR Information Systems and Operational Research ◽

10.3138/infor.45.2.75 ◽

2007 ◽

Vol 45 (2) ◽

pp. 75-81 ◽

Cited By ~ 6

Author(s):

Tamer Eren ◽

Ertan Güner

Keyword(s):

Completion Time ◽

Learning Effect ◽

Total Tardiness ◽

Total Completion Time ◽

Scheduling Problem ◽

Bicriteria Scheduling

Download Full-text

Minimizing total completion time on a batching machine with job processing time compatibilities

Electronic Notes in Discrete Mathematics ◽

10.1016/j.endm.2010.05.164 ◽

2010 ◽

Vol 36 ◽

pp. 1295-1302 ◽

Cited By ~ 3

Author(s):

A. Bellanger ◽

A. Oulamara ◽

M.Y. Kovalyov

Keyword(s):

Completion Time ◽

Processing Time ◽

Total Completion Time ◽

Batching Machine

Download Full-text

A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING

International Journal of Foundations of Computer Science ◽

10.1142/s0129054102001473 ◽

2002 ◽

Vol 13 (06) ◽

pp. 817-827 ◽

Cited By ~ 7

Author(s):

XIAOTIE DENG ◽

HAODI FENG ◽

GUOJUN LI ◽

GUIZHEN LIU

Keyword(s):

Completion Time ◽

Processing Time ◽

Approximation Scheme ◽

Processing System ◽

Handling Time ◽

Batch Scheduling ◽

Total Completion Time ◽

Polynomial Time Approximation Scheme ◽

Time Approximation ◽

System P

We consider a batch processing system {pi : i = 1, 2,…,n} where pi is the processing time of job i, and up to B jobs can be processed together such that the handling time of a batch is the longest processing time among jobs in the batch. The number of job types m is not fixed and all the jobs are released at the same time. Jobs are executed non-preemptively. Our objective is to assign jobs to batches and sequence the batches so as to minimize the total completion time. The best previously known result is a 2–approximation algorithm. In this paper, we establish the first polynomial time approximation scheme (PTAS) for the problem.

Download Full-text