- ALT , H. , BLUM , N. , MEHLHORN , K. and PAUL , M. 1991 . Computing maximum cardinality matching in a bipartite graph in time O n 1.5 m . Information Processing Letters , 37 : 237 – 240 .
- BAKER , K. R. 1974 . Introduction to Sequencing and Scheduling , New York : Wiley .
- DAVIs , J. S. and KENET , J. J. 1993 . Single-machine scheduling with early and tardy completion costs . Naval Research Logistics , 40 : 85 – 101 .
- GAREY , M. R. , TARJAN , R. E. and WILFGONG , G. T. 1988 . One-processor scheduling with symmetric earliness and tardiness penalties . Mathematics of Operations Research , 13 : 330 – 348 .
- HOOGEVEEN , J. H. and VAN DE YELDE , S. L. 1996 . A branchand-bound algorithm for single-machine carliness-tardiness scheduling with idle times . INFORMS Journal on Computing , 8 (4) : 402 – 412 .
- SZWARC , W. and MUKHOPADHYAY , S. 1995 . Optimal timing schedules in carlincss-tardincss single machine sequencing . Naval Research Logistics , 42 : 1109 – 1114 .
- WENNINK , M. 1995 . Algorithmic support for automated planning boards , The Netherlands : Department of Mathematics and Computing Science, Eindhoven University of Technology . PhD Thesis
- Choose new content alerts to be informed about new research of interest to you
- Easy remote access to your institution's subscriptions on any device, from any location
- Save your searches and schedule alerts to send you new results
- Export your search results into a .csv file to support your research