J4 ›› 2012, Vol. 47 ›› Issue (3): 77-80.

• Articles • Previous Articles     Next Articles

The algorithm of the bounded batch scheduling problem  with a decision due window

HAN Guo-yong, ZHAO Hong-luan, LIU Hao, LIU Zhen-dong, ZHANG Zhi-jun   

  1. School of Computer Science ＆ Technology, Shandong Jianzhu University, Jinan 250101,  Shandong, China
  • Received:2010-08-09 Online:2012-03-20 Published:2012-04-01

PDF (PC)

2191

Abstract:

The due window situation is combined with the conception of batch so that the jobs can be processed in batches on a single machine. To minimize the weighted number of early and tardy jobs, the batch is bounded and all the jobs share a common due window［e, d］. Further, the location and size of the due window are decision variables, and the optimal sequence is determined. An efficient algorithm is proposed with several optimal properties.

Key words: batch; due window; earliness; tardiness

No related articles found!
Viewed
Full text
801
HTML PDF
Just accepted Online first Issue Just accepted Online first Issue
0 0 0 0 0 801

  From Others local
  Times 53 748
  Rate 7% 93%

Abstract
792
Just accepted Online first Issue
0 0 792
  From Others local
  Times 789 3
  Rate 100% 0%

Cited
Web of Science  Crossref   ScienceDirect  Search for Citations in Google Scholar >>
 
This page requires you have already subscribed to WoS.
  Shared   
  Discussed   
No Suggested Reading articles found!
Copyright 2018 © Editorial office of JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE)
Supported by Beijing Magtech Co.Ltd