The Search is performed on all of the following fields:
Note: Please use complete words only.

Publication Title

Abstract

Publication Keywords

DOI

Proceeding Title

Proceeding Foreword

ISBN (Completed)

Insticc Ontology

Author Affiliation

Author Name

Editor Name

If you're looking for an exact phrase use quotation marks on text fields.

Paper

Un-restricted Common Due-Date Problem with Controllable Processing Times - Linear Algorithm for a Given Job SequenceTopics: Industrial Applications of Artificial Intelligence; Operational Research; Problem Solving; Scheduling and Planning

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 comparing the two heuristic approaches, as well. The implementation
is carried out on appended CDD benchmark instances provided in the OR-library.
(More)

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 comparing the two heuristic approaches, as well. The implementation is carried out on appended CDD benchmark instances provided in the OR-library.

Guests can use SciTePress Digital Library without having a SciTePress account. However, guests have limited access to downloading full text versions of papers and no access to special options.

Guests can use SciTePress Digital Library without having a SciTePress account. However, guests have limited access to downloading full text versions of papers and no access to special options.

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 2: 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 2: 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 2: 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