Loading...
Please wait, while we are loading the content...
Single-machine batch scheduling minimizing weighted flow times and delivery costs with job release times
| Content Provider | Directory of Open Access Journals (DOAJ) |
|---|---|
| Author | Amir Ebrahimzadeh Pilerood Mohammad Mahdavi Mazdeh Ali Naji Esfahani Seyyed Ershad Sakkaki |
| Abstract | This paper addresses scheduling a set of weighted jobs on a single machine in presence of release date for delivery in batches to customers or to other machines for further processing. The problem is a natural extension of minimizing the sum of weighted flow times by considering the possibility of delivering jobs in batches and introducing batch delivery costs. The classical problem is NP-hard and then the extended version of the problem is NP-hard. The objective function is that of minimizing the sum of weighted flow times and delivery costs. The extended problem arises in a real supply chain network by cooperation between two layers of chain. Structural properties of the problem are investigated and used to devise a branch-and-bound solution scheme. Computational experiments show the efficiency of suggested algorithm for solving instances up to 40 jobs. |
| Related Links | http://www.growingscience.com/ijiec/Vol3/IJIEC_2012_24.pdf |
| ISSN | 19232926 |
| Journal | International Journal of Industrial Engineering Computations |
| Issue Number | 3 |
| Volume Number | 3 |
| e-ISSN | 19232934 |
| Language | English |
| Publisher | Growing Science |
| Publisher Date | 2012-01-01 |
| Publisher Place | Canada |
| Access Restriction | Open |
| Subject Keyword | Industrial Engineering. Management Engineering Production Management. Operations Management Scheduling Single Machine Batch Delivery Branch and Bound Weighted Flowtimes Industrial engineering. Management engineering Men Production management. Operations management |
| Content Type | Text |
| Resource Type | Article |
| Subject | Industrial and Manufacturing Engineering |
