@INPROCEEDINGS{7007158,
author={Awasthi, A. and Lassig, J. and Kramer, O. and Weise, T.},
booktitle={Computational Intelligence in Production and Logistics Systems (CIPLS), 2014 IEEE Symposium on},
title={Common Due-Window problem: Polynomial algorithms for a given processing sequence},
year={2014},
month={Dec},
pages={32-39},
keywords={computational complexity;minimisation;simulated annealing;single machine scheduling;CDW optimization;CDW problem;O(n) algorithm;O(n2) run-time complexity;SA;common due-window problem;different-asymmetric earliness penalties;different-asymmetric tardiness penalties;due-window lengths;job processing sequence;job processing times;optimal completion times;polynomial algorithms;simulated annealing;single machine process;total penalty minimization;unit processing times;Educational institutions;Job shop scheduling;Optimal scheduling;Polynomials;Schedules;Silicon},
doi={10.1109/CIPLS.2014.7007158},}