An optimal schedule for printing and binding

An optimal solution is presented for the scheduling of printing and binding of a book order. The algorithm is simpler and faster than previously known methods. If the book is divided into n parts and the typesetting time for each part is different, the algorithm takes steps. The algorithm operates i...

Full description

Bibliographic Details

Published in:	International journal of computer mathematics Vol. 15; no. 1-4; pp. 117 - 127
Main Authors:	Chin, Francis, Wong, Michael
Format:	Journal Article
Language:	English
Published:	Abingdon Gordon and Breach Science Publishers 01.01.1984 Taylor and Francis
Subjects:	Algorithm Algorithmics. Computability. Computer arithmetics Applied sciences Computer science; control theory; systems Exact sciences and technology F.2.2. Nonnumerical Algorithms and Problems Job Scheduling Optimality Theoretical computing Printing Integrated planning Algorithm analysis Optimization
ISSN:	0020-7160, 1029-0265
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!