A BRANCH-AND-BOUND ALGORITHM FOR TWO-COMPETING-AGENT SINGLE-MACHINE SCHEDULING PROBLEM WITH JOBS UNDER SIMULTANEOUS EFFECTS OF LEARNING AND DETERIORATION TO MINIMIZE TOTAL WEIGHTED COMPLETION TIME WITH NO-TARDY JOBS
DOI:
https://doi.org/10.23055/ijietap.2021.28.6.7723Keywords:
Multi agent scheduling, Variable processing times, Learning effect, Deterioration effect, Branch-and-bound algorithmAbstract
Recent scheduling studies focus on variable job-processing times and multi-agent problems simultaneously, but none of them studied with jobs under the simultaneous effect of learning and deterioration. This paper studies a two-competing-agent single-machine scheduling problem with jobs under simultaneous learning and deterioration effect. The goal is to find an optimal solution to minimize the total weighted completion time for the first agent, subject to the restriction that no tardy job is allowed for the second agent. According to our current literature knowledge, this paper will be the first one with these specifications. For this problem, a two-stage methodology is developed in the study. In the first stage, heuristics are proposed to find the near-optimal solution of which is used as input for the second stage. For the second stage, a branch-and-bound algorithm along with several dominances and a lower bound is developed to find the optimal solution. Computational experiments are provided to further measure the performance of the proposed algorithms.
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.
