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...

Celý popis

Podrobná bibliografia

Vydané v:	International journal of computer mathematics Ročník 15; číslo 1-4; s. 117 - 127
Hlavní autori:	Chin, Francis, Wong, Michael
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Abingdon Gordon and Breach Science Publishers 01.01.1984 Taylor and Francis
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!