loading
Documents

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Abhishek Awasthi 1 ; Jörg Lässig 1 and Oliver Kramer 2

Affiliations: 1 University of Applied Sciences Zittau/Görlitz, Germany ; 2 Carl von Ossietzky University of Oldenburg, Germany

ISBN: 978-989-758-096-3

Keyword(s): Scheduling, Algorithms, Simulated Annealing, NP-Hard.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence and Decision Support Systems ; Enterprise Information Systems ; Industrial Applications of Artificial Intelligence ; Operational Research ; Problem Solving ; Scheduling and Planning

Abstract: This paper considers the un-restricted case of the Common Due-Date (CDD) problem with controllable processing times. The problem consists of scheduling jobs with controllable processing times on a single machine against a common due-date to minimize the overall earliness/tardiness and the compression penalties of the jobs. The objective of the problem is to find the processing sequence of jobs, the optimal reduction in the processing times of the jobs and their completion times. In this work, we first present and prove an essential property for the controllable processing time CDD problem for the un-restricted case along with an exact linear algorithm for optimizing a given job sequence for a single machine with a run-time complexity of O(n), where n is the number of jobs. Henceforth, we implement our polynomial algorithm in conjunction with a modified Simulated Annealing (SA) algorithm and Threshold Accepting (TA) to obtain the optimal/best processing sequence while comparin g the two heuristic approaches, as well. The implementation is carried out on appended CDD benchmark instances provided in the OR-library. (More)

PDF ImageFull Text

Download
Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 54.234.75.144

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Awasthi A., Lässig J. and Kramer O. (2015). Un-restricted Common Due-Date Problem with Controllable Processing Times - Linear Algorithm for a Given Job Sequence.In Proceedings of the 17th International Conference on Enterprise Information Systems - Volume 1: ICEIS, ISBN 978-989-758-096-3, pages 526-534. DOI: 10.5220/0005398205260534

@conference{iceis15,
author={Abhishek Awasthi and Jörg Lässig and Oliver Kramer},
title={Un-restricted Common Due-Date Problem with Controllable Processing Times - Linear Algorithm for a Given Job Sequence},
booktitle={Proceedings of the 17th International Conference on Enterprise Information Systems - Volume 1: ICEIS,},
year={2015},
pages={526-534},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005398205260534},
isbn={978-989-758-096-3},
}

TY - CONF

JO - Proceedings of the 17th International Conference on Enterprise Information Systems - Volume 1: ICEIS,
TI - Un-restricted Common Due-Date Problem with Controllable Processing Times - Linear Algorithm for a Given Job Sequence
SN - 978-989-758-096-3
AU - Awasthi A.
AU - Lässig J.
AU - Kramer O.
PY - 2015
SP - 526
EP - 534
DO - 10.5220/0005398205260534

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.