MAKESPAN MINIMIZATION ON A SINGLE BATCH PROCESSING MACHINE WITH UNEQUAL JOB READY TIMES
DOI:
https://doi.org/10.23055/ijietap.2011.18.10.387Keywords:
Scheduling, batch processing machine, heuristics, makespanAbstract
A batch processing machine (BPM) can process several jobs simultaneously as a batch as long as its capacity is not violated. The processing time of each job, their ready times and sizes are given. This research was motivated by a practical application observed at an electronics manufacturing facility where a BPM is a bottleneck and consequently minimizing the makespan is the primary objective. The batch processing time is the largest processing time among the jobs in the batch, and the batch ready time is the largest ready time among the jobs in the batch. Given that the problem is NP-hard we propose a constructive heuristic to solve the problem under the assumptions of non-identical job sizes and non-zero job ready times. The computational experiments conducted on a set of randomly generated problem instances show that the proposed approach outperforms other approaches available in the literature at a reasonable computational cost.Published
How to Cite
Issue
Section
License
The Author(s) must formally transfer each article's copyright before publication in the INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING. Such transfer enables the Journal to defend itself against plagiarism and other forms of copyright infringement. Your cooperation is appreciated.
You agree that the copyright of your article to be published in the INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING - THEORY, APPLICATIONS, AND PRACTICE is hereby transferred, throughout the World and for the full term and all extensions and renewals thereof, to INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING - THEORY, APPLICATIONS, AND PRACTICE.
The Author(s) reserve(s): (a) the trademark rights and patent rights, if any, and (b) the right to use all or part of the information contained in this article in future, non-commercial works of the Author's own, or, if the article is a "work-for-hire" and made within the scope of the Author's employment, the employer may use all or part of the information contained in this article for intra-company use, provided the usual acknowledgments are given regarding copyright notice and reference to the original publication.
The Author(s) warrant(s) that the article is Author's original work and has not been published before. If excerpts from copyrighted works are included, the Author will obtain written permission from the copyright owners and credit the article's sources.
The author also warrants that the article contains no libelous or unlawful statements and does not infringe on the rights of others. If the article was prepared jointly with other Author(s), the Author agrees to inform the co-Author(s) of the terms of the copyright transfer and to sign on their behalf; or in the case of a "work-for-hire," the employer or an authorized representative of the employer.
The journal does not provide the author copy of the final paper when it is published. The author(s) can make(s) a subscription to INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING - THEORY, APPLICATIONS, AND PRACTICE if they want to get the final paper that has already been published.
The journal is registered with the Library of Congress (ISSN # 1943-670X). All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise, without the prior written permission of the journal.
The author reserves patent and trademark rights and the right to use all or part of the information contained in the article in future non-commercial works.
