COMMON DUE-DATE ASSIGNMENT AND SCHEDULING ON A SINGLE MACHINE WITH SEQUENCE-DEPENDENT SETUPS AND DISCRETELY CONTROLLABLE PROCESSING TIMES
DOI:
https://doi.org/10.23055/ijietap.2018.25.5.3676Keywords:
single machine, common due-date assignment and scheduling, controllable processing times, sequence-dependent setups, heuristicsAbstract
This study addresses a common due-date assignment and scheduling problem on a single machine in which job processing times are not given, but controllable. The problem is to determine the common due-date, the processing times and the sequence of the jobs to be processed on the single machine. The controllable processing times are considered in the discrete form in that the processing time of a job is determined by selecting one of its discretely available ones with different processing costs. In particular, sequence-dependent setups, in which setup times depend on the type of job just completed and the job to be processed, are also considered. A mixed integer programming model is proposed for the problem that minimizes the sum of earliness, tardiness, due-date assignment and job processing costs. Then, due to the problem complexity, two-stage heuristic algorithms are proposed in which an initial solution is obtained by the positional weights and it is improved by the pairwise interchange method together with determining the job processing times. Computational experiments were done on a number of random instances and the results are reported.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.
