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

Uložené v:

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!

Abstract	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 in linear time if all the typesetting times are identical. The problem can be generalized easily to other problems and its optimal solution can be applied to other two-stage production processes with overheads for interruptions.
AbstractList	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 in linear time if all the typesetting times are identical. The problem can be generalized easily to other problems and its optimal solution can be applied to other two-stage production processes with overheads for interruptions.
Author	Wong, Michael Chin, Francis
Author_xml	– sequence: 1 givenname: Francis surname: Chin fullname: Chin, Francis organization: Department of Computing Science , University of Alberta – sequence: 2 givenname: Michael surname: Wong fullname: Wong, Michael organization: Department of Computer Science , University of Regina
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=8864758$$DView record in Pascal Francis
BookMark	eNp1kE1Lw0AQhhepYFv9Ad5y8Gh09nsDXkrxCwpe9Bym2V2NJJuyG5H-e7dEvYinGZjnnXnnXZBZGIIj5JzCFQUD1wAMNFVGgDHABcgjMqfAqhKYkjMyP8zLDMAJWaT0DgCm0mpOLlehGHZj22NXpObN2Y_OFX6IxS62YWzDa4HBFts22NyfkmOPXXJn33VJXu5un9cP5ebp_nG92pQN03osqaVcM8pQA4L0THvnjasogLZCeKgMz4RgqvIGpUZqqOVScKmVVlsn-ZJcTHt3mBrsfMTQtKnOlnqM-9oYJbQ0GaMT1sQhpej8L0GhPqRS_0kla24mTRvylz1-DrGz9Yj7bog_d_j_8i9_TGY5
CODEN	IJCMAT
ContentType	Journal Article
Copyright	Copyright Taylor & Francis Group, LLC 1984 1985 INIST-CNRS
Copyright_xml	– notice: Copyright Taylor & Francis Group, LLC 1984 – notice: 1985 INIST-CNRS
DBID	AAYXX CITATION IQODW
DOI	10.1080/00207168408803405
DatabaseName	CrossRef Pascal-Francis
DatabaseTitle	CrossRef
DatabaseTitleList
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science Applied Sciences
EISSN	1029-0265
EndPage	127
ExternalDocumentID	8864758 10_1080_00207168408803405 8803405
GroupedDBID	-~X 07G 0R~ 1TA 4.4 5GY 5VS AAIKQ AAKBW AAYJJ ABEFU ABJNI ABUFD ACGEE ACGEJ ACGFS ACGOD ACIWK ACNCT ADCVX ADXPE AENEX AEPSL AEUMN AEYOC AFFNX AGLEN AI. ALMA_UNASSIGNED_HOLDINGS AMVHM AMXXU AQTUD AWYRJ BCCOT BPLKW C06 CS3 DU5 DWIFK EBS EJD H13 HZ~ IVXBP NA5 NUSFT NY~ O9- P2P PQQKQ TAQ TDBHL TFL TFMCV TFW TN5 TOXWX UB9 UPT UU8 V3K V4Q VH1 WH7 ZY4 .4S .7F .DC .QJ 0BK 29J 30N AAENE AAGDL AAHIA AAJMT AALDU AAMIU AAPUL AAQRR AAYXX ABCCY ABDBF ABFIM ABHAV ABLIJ ABPAQ ABPEM ABTAI ABXUL ABXYU ACAGQ ACTCW ACTIO ACUHS ADGTB AEISY AEOZL AFKVX AFRVT AGCQS AGDLA AGMYJ AGROQ AHDZW AHMOU AIJEM AIYEW AJWEG AKBVH AKOOK ALCKM ALQZU AMEWO AQRUH ARCSS AVBZW BLEHA CAG CCCUG CE4 CITATION COF CRFIH DGEBU DKSSO DMQIW EAP EDO EMK EPL EST ESX E~A E~B GTTXZ HF~ H~9 H~P IPNFZ J.P KYCEM LJTGL M4Z MK~ QCRFL RIG RNANH ROSJB RTWRZ S-T SNACF TASJS TBQAZ TEJ TFT TTHFI TUROJ TUS TWF UT5 UU3 ZGOLN ~S~ ABTAH ADYSH IQODW
ID	FETCH-LOGICAL-c277t-1d137212a70a05f27fef8e91007d44f0983d134269f8a57a181d354357676be53
IEDL.DBID	TFW
ISICitedReferencesCount	0
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=10_1080_00207168408803405&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0020-7160
IngestDate	Wed Apr 02 07:20:02 EDT 2025 Sat Nov 29 02:21:21 EST 2025 Mon Oct 20 23:42:49 EDT 2025
IsPeerReviewed	true
IsScholarly	true
Issue	1-4
Keywords	Printing Integrated planning Algorithm analysis Optimization
Language	English
License	CC BY 4.0
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c277t-1d137212a70a05f27fef8e91007d44f0983d134269f8a57a181d354357676be53
PageCount	11
ParticipantIDs	informaworld_taylorfrancis_310_1080_00207168408803405 pascalfrancis_primary_8864758 crossref_primary_10_1080_00207168408803405
PublicationCentury	1900
PublicationDate	1/1/1984 1984-01-00 1984
PublicationDateYYYYMMDD	1984-01-01
PublicationDate_xml	– month: 01 year: 1984 text: 1/1/1984 day: 01
PublicationDecade	1980
PublicationPlace	Abingdon
PublicationPlace_xml	– name: Abingdon
PublicationTitle	International journal of computer mathematics
PublicationYear	1984
Publisher	Gordon and Breach Science Publishers Taylor and Francis
Publisher_xml	– name: Gordon and Breach Science Publishers – name: Taylor and Francis
References	Coffman E.A. (CIT0001) 1976 Knuth D.E. (CIT0003) 1973; 3 Hu T.C. (CIT0002) 1970 Sancho N.G.F. (CIT0004) 1976; 14
References_xml	– volume: 3 volume-title: The Art of Computer Programming—Sorting and Searching year: 1973 ident: CIT0003 – volume-title: Computer and Job-shop Scheduling Theory year: 1976 ident: CIT0001 – volume-title: Integer Programming and Network Flows year: 1970 ident: CIT0002 – volume: 14 start-page: 164 issue: 2 year: 1976 ident: CIT0004 publication-title: INFOR
SSID	ssj0008976
Score	1.2574389
Snippet	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....
SourceID	pascalfrancis crossref informaworld
SourceType	Index Database Publisher
StartPage	117
SubjectTerms	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
Title	An optimal schedule for printing and binding
URI	https://www.tandfonline.com/doi/abs/10.1080/00207168408803405
Volume	15
WOSCitedRecordID	wos10_1080_00207168408803405&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVAWR databaseName: Taylor & Francis customDbUrl: eissn: 1029-0265 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0008976 issn: 0020-7160 databaseCode: TFW dateStart: 19640101 isFulltext: true titleUrlDefault: https://www.tandfonline.com providerName: Taylor & Francis
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LSwMxEA5SPHjxLVat5OBJDGSzSZMci1g8FQ8Ve1uSNIGCbqW7-vudZLdLK-JB77NJmMwjM_vNDEI3QupAuQ8ELKQknJmMmOApCZbnznltGXNp2IScTNRspp9abE7VwipjDB2aRhHJVkflNrZaI-JiBTc4xtilBIQv56mDKbj9qJbT8Utnh5VOo-UiNQHy7p_mTytseaWtnqURLGkq4FdoBl1seJ_xwT_PfYj222cnHjVycoR2fHmMDtYjHXCr4SfoblTiJViRNyCGuBf80KvHcEwc838RIY1hd2wXqRbmFD2PH6b3j6QdqEAck7Im2TzLIeJjRlJDRWAy-KC8jkCJOeeBapUDRSxuDcoIacD7z3MBDyo5lEPrRX6GeuWy9OcIWx-8C8FpSeFWjTMiji2RmmqfOcVsH92uGVq8N30ziqxrR_qND30kNlle1ClZ0TK8yH_5brB1N91OSg05BEIXf1z3Eu1lWvEm03KFevXqww_QrvusF9XqOknZF6LuzVQ
linkProvider	Taylor & Francis
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LSwMxEB6kCnqxPrFqNQdPYmAfSZMci1gq1uKhYm9LNk2goFtpV3-_k93t0op40PtsEiaTee3MNwBXXCgXMOsoakhBWaRDqp0NqEtZbIxVaRSZYtiEGA7leKyeqoTboiqr9DG0K4EiCl3tH7dPRi9L4nwLN1pGD1OC0hczD2G6ydHOeuz8Ue-l1sRSFcPlPDlF-vqv5k9LrNmlNdRSXy6pF8gxV466WLE_veZ_T74Hu5XnSbqlqOzDhs0OoLmc6kCqR34IN92MzFCRvCExhr5oil4twXMSnwL0RdIEtyfptGiHOYLn3t3otk-rmQrURELkNJyEMQZ9kRaBDriLhLNOWuVrJSaMuUDJGCl8f6uTmguNDsAk5uhTiY7opJbHx9DIZpk9AZJaZ41zRokAL1Ybzf3kEqECZUMjo7QF10uOJu8ldEYS1oik3_jQAr7K8yQv8hUVx5P4l-_aa5dT7yRlh2EsdPrHdS9huz96HCSD--HDGeyESrIy8XIOjXz-YduwZT7z6WJ-UYjcF7z50X4
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3dS8MwED9kivji_MSp0zz4JAb6kTbJ41CHoow9TNxbSdMEBtqNrfr3e2m7son4oO_XJFwu99W73wFcRVxajxlLUUNyygLlU2WNR23KQq2NTINAl8Mm-GAgxmM5rGtzFnVZpYuhbQUUUepq97hnmV1WxLkObjSMDqUEhS9kDsF0E93m2An4qP_aKGIhy9lyjpwiffNT86cl1szSGmipq5ZUC2SYrSZdrJiffvufB9-D3drvJL1KUPZhw-QH0F7OdCD1Ez-Em15OpqhG3pEYA180RG-G4DGJSwC6EmmCu5N0UjbDHMFL_350-0DriQpUB5wX1M_8EEO-QHFPeZENuDVWGOkqJTLGrCdFiBSuu9UKFXGF5j8LI_SoeMzj1EThMbTyaW5OgKTGGm2tltzDa1VaRW5uCZeeNL4WQdqB6yVDk1kFnJH4DR7pNz50IFpleVKU2Yqa4Un4y3fdtbtpdhIiZhgJnf5x3UvYHt71k-fHwdMZ7PhSsCrrcg6tYv5hurClP4vJYn5RCtwXZcnQMA
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+optimal+schedule+for+printing+and+binding&rft.jtitle=International+journal+of+computer+mathematics&rft.au=CHIN%2C+F&rft.au=WONG%2C+M&rft.date=1984&rft.pub=Taylor+and+Francis&rft.issn=0020-7160&rft.volume=15&rft.issue=2&rft.spage=117&rft.epage=127&rft_id=info:doi/10.1080%2F00207168408803405&rft.externalDBID=n%2Fa&rft.externalDocID=8864758
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-7160&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-7160&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-7160&client=summon