Journal Paper

Paper Information

video

sound

Persian Version

View:

262

Download:

0

Cites:

Information Journal Paper

Title

NEW LOWER BOUNDS FOR THE OPTIMAL MAKESPAN ON A SINGLE BATCH PROCESSING MACHINE

Pages

 Start Page 75 | End Page 84

Abstract

 This paper considers minimizing MAKESPAN (Cmax) on a single BATCH-PROCESSING MACHINE. A batch processing machine can process a group of jobs simultaneously, as long as the total size of jobs in the batch does not exceed the machine capacity (B). For each job, we assume a specific job size and job processing time. The processing time of a batch is just the longest processing time of all jobs in the batch. We introduce two new procedures for obtaining LOWER BOUNDS of the optimal MAKESPAN, entitled LB2 and LB3, respectively. We prove that both of the new bounds are tighter than the only existing bound called LB1. We also prove that LB3 is at least as tight as LB2.

Cites

  • No record.
  • References

  • No record.
  • Related Journal Papers

    Related Seminar Papers

  • No record.
  • Related Plans

  • No record.
  • Recommended Workshops






    File Not Exists.