An implicit enumeration algorithm for complex scheduling problems

Several algorithms have been presented for handling complex scheduling problems. These methods are computationally impractical when confronted with large problems. New algorithms have been developed for solving job-shop problems. They are more efficient than the previous ones because they use domina...

Full description

Saved in:
Bibliographic Details
Published in:International journal of production research Vol. 13; no. 1; pp. 25 - 40
Main Authors: FLORIAN, M., TILQUIN, C., TILQUIN, G.
Format: Journal Article
Language:English
Published: Taylor & Francis Group 01.01.1975
ISSN:0020-7543, 1366-588X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Several algorithms have been presented for handling complex scheduling problems. These methods are computationally impractical when confronted with large problems. New algorithms have been developed for solving job-shop problems. They are more efficient than the previous ones because they use dominance and better bound ideas. The purpose of this paper is to present an efficient algorithm for complex scheduling problems generalizing those ideas.
AbstractList Several algorithms have been presented for handling complex scheduling problems. These methods are computationally impractical when confronted with large problems. New algorithms have been developed for solving job-shop problems. They are more efficient than the previous ones because they use dominance and better bound ideas. The purpose of this paper is to present an efficient algorithm for complex scheduling problems generalizing those ideas.
Author TILQUIN, C.
FLORIAN, M.
TILQUIN, G.
Author_xml – sequence: 1
  givenname: M.
  surname: FLORIAN
  fullname: FLORIAN, M.
– sequence: 2
  givenname: C.
  surname: TILQUIN
  fullname: TILQUIN, C.
– sequence: 3
  givenname: G.
  surname: TILQUIN
  fullname: TILQUIN, G.
  organization: Dèpartement d'Informatique , Université de Montréal
BookMark eNp9kE1LAzEQhoNUsK3-AG_5A6uZZJPdBS-l-AUFLwreltlsto1kk5Js0f57t9aTonOZw7zPwPPOyMQHbwi5BHYFrGTXjHFWyLyQrKxyXhX8hExBKJXJsnydkOnhno0BcUZmKb2xcWSZT8li4antt85qO1Djd72JONjgKbp1iHbY9LQLkeowZswHTXpj2p2zfk23MTTO9OmcnHbokrn43nPycnf7vHzIVk_3j8vFKtMcYMhKgWAEKhRVK5TRBpWRBlqVi0ZyVoEEBhV2uVGsYapF4A0rBGiutMhBiDmB418dQ0rRdPU22h7jvgZWHzqof3UwMsUPZtT88hsiWvcveXMkrR_9e3wP0bX1gHsXYhfRa5tq8Tf-CQfXdIA
CitedBy_id crossref_primary_10_1080_00207547908919598
crossref_primary_10_1108_eb014469
Cites_doi 10.1002/nav.3800200106
10.1287/opre.17.6.941
10.1287/mnsc.13.4.B176
10.1287/mnsc.17.5.307
10.1287/opre.18.4.689
10.1287/opre.18.2.263
ContentType Journal Article
Copyright Copyright Taylor & Francis Group, LLC 1975
Copyright_xml – notice: Copyright Taylor & Francis Group, LLC 1975
DBID AAYXX
CITATION
DOI 10.1080/00207547508942972
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1366-588X
EndPage 40
ExternalDocumentID 10_1080_00207547508942972
8942972
GroupedDBID -~X
07I
0R~
1TA
4.4
4B5
5GY
5VS
8VB
A8Z
ABDPE
ABJNI
ACGEJ
ACGFO
ACGFS
ACGOD
ACIWK
ACKIV
ACNCT
ADCVX
ADXEU
ADXPE
AEGXH
AEHZU
AEMOZ
AENEX
AEPSL
AEYOC
AEZBV
AFFNX
AFION
AGBLW
AGYFW
AHQJS
AIAGR
AKHJE
AKMBP
AKVCP
ALMA_UNASSIGNED_HOLDINGS
ALXIB
AQTUD
AWYRJ
BGSSV
C0-
C5H
CS3
DEXXA
DU5
EBO
EBR
EBS
EBU
EJD
EMK
ESTFP
FETWF
H13
HZ~
I-F
IFELN
K1G
L8C
ML~
NA5
NUSFT
NX~
O9-
P2P
PQQKQ
QWB
TAJZE
TAP
TDBHL
TFL
TFT
TFW
TH9
TN5
UB6
ZL0
.7F
.QJ
0BK
1OL
29J
2DF
30N
AAENE
AAGDL
AAHIA
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
AAYXX
ABCCY
ABFIM
ABHAV
ABLIJ
ABPAQ
ABPEM
ABRLO
ABTAI
ABXUL
ABXYU
ACTIO
ACTTO
ADGTB
ADUMR
AEISY
AEOZL
AFBWG
AFKVX
AFRVT
AGBKS
AGDLA
AGMYJ
AGVKY
AGWUF
AHDZW
AI.
AIJEM
AIYEW
AJWEG
AKBVH
AKOOK
ALQZU
ALRRR
AQRUH
AVBZW
BLEHA
BWMZZ
CAG
CCCUG
CE4
CITATION
COF
CYRSC
DAOYK
DGEBU
DKSSO
EBD
EBE
EPL
E~A
E~B
GTTXZ
HF~
H~9
H~P
IPNFZ
J.P
KYCEM
LJTGL
M4Z
OPCYK
RIG
RNANH
RNS
ROSJB
RTWRZ
S-T
SNACF
TASJS
TBQAZ
TEN
TNC
TTHFI
TUROJ
TWF
UT5
UU3
VH1
ZCG
ZGOLN
ZY4
~S~
ID FETCH-LOGICAL-c211t-83a1e3a6a39d36ecea6e5e1d643b5209151019af4e60b06da12b0731c26c34133
IEDL.DBID TFW
ISSN 0020-7543
IngestDate Sat Nov 29 03:54:35 EST 2025
Tue Nov 18 21:18:10 EST 2025
Mon Oct 20 23:40:43 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c211t-83a1e3a6a39d36ecea6e5e1d643b5209151019af4e60b06da12b0731c26c34133
PageCount 16
ParticipantIDs crossref_primary_10_1080_00207547508942972
informaworld_taylorfrancis_310_1080_00207547508942972
crossref_citationtrail_10_1080_00207547508942972
PublicationCentury 1900
PublicationDate 1/1/1975
1975-01-00
PublicationDateYYYYMMDD 1975-01-01
PublicationDate_xml – month: 01
  year: 1975
  text: 1/1/1975
  day: 01
PublicationDecade 1970
PublicationTitle International journal of production research
PublicationYear 1975
Publisher Taylor & Francis Group
Publisher_xml – name: Taylor & Francis Group
References MOUEZA M. (CIT0009) 1971
ROY B. (CIT0011) 1964
CIT0001
CIT0012
CIT0003
CIT0002
CIT0004
NGUYEN SANG (CIT0010) 1970
CIT0006
CONWAY R. W. (CIT0005) 1967
References_xml – volume-title: SEMA : Direction Scienlifique.
  year: 1971
  ident: CIT0009
– ident: CIT0003
  doi: 10.1002/nav.3800200106
– volume-title: SEMA Direction Scienlifique.
  year: 1964
  ident: CIT0011
– ident: CIT0002
  doi: 10.1287/opre.17.6.941
– ident: CIT0001
  doi: 10.1287/mnsc.13.4.B176
– volume-title: Theory of Schedvling
  year: 1967
  ident: CIT0005
– volume-title: Etude de 3 Méthodes de Résolution du Problème d'Ordonnance-ment
  year: 1970
  ident: CIT0010
– ident: CIT0006
  doi: 10.1287/mnsc.17.5.307
– ident: CIT0004
  doi: 10.1287/opre.18.4.689
– ident: CIT0012
  doi: 10.1287/opre.18.2.263
SSID ssj0000584
Score 1.2231842
Snippet Several algorithms have been presented for handling complex scheduling problems. These methods are computationally impractical when confronted with large...
SourceID crossref
informaworld
SourceType Enrichment Source
Index Database
Publisher
StartPage 25
Title An implicit enumeration algorithm for complex scheduling problems
URI https://www.tandfonline.com/doi/abs/10.1080/00207547508942972
Volume 13
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAWR
  databaseName: Taylor & Francis (UCD Library purchased years)
  customDbUrl:
  eissn: 1366-588X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000584
  issn: 0020-7543
  databaseCode: TFW
  dateStart: 19610101
  isFulltext: true
  titleUrlDefault: https://www.tandfonline.com
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwELYQYoCBN6K85IEJyZIfsRuPFaJiQBVDgW6R7dgQqaSoCYifj524pUXAALsvsmzffWfnu-8AOHfc0hwbjVLGNEocd0hqyhFPsaRYK8UbMZ37m-5gkI5G8jZyc6pIqwx3aNcKRTSxOji30tWMERcquD3QJR7rUunDaTdEYA_7wS2H_YfPOMzTqMGMkR_OZv80v_vCEiotaZYuoE1_65_z3AabMc2EvfZc7IAVW-6CjQXxwT3Q65WwaPjkRQ0DId62hwGq8eNkWtRPz9DPDzacc_sO_S3Yo1IoXoexCU21D-76V8PLaxQbKiDj73m13w9FLFNCMZkzYY1VwnJLcp-V6ECHIcFBpXKJFVhjkStCtQ8BxFBhAtqxA7BaTkp7CKAWjlJJQyFvnhgpUkNCJpIrFyThmekAPFvQzES18dD0YpyRuSjpl9XpgIu5yUsrtfHbYL64S1ndvG-4thlJxn60O_qj3TFYJ7LL28eXE7BaT1_tKVgzb3VRTc-ag_cBBI7S2g
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT8MwDLYQIAEH3ojxzIETUqUmWbLmOCGmIcbEYcBuVZImUGl0aCuIn0_SdmNDwAHucRUljj_btT8DnFlmSBJqFUSUqqBumQ2EIixgUShIqKRkBZnOfafR7Ub9vritEm7jqqzSx9C2JIoobLV_3D4ZPSmJ8y3cDunqDuwi4expw5ngJeZw1nPn91oPn5aYRRULcxi49XTyV_O7T8zh0hxr6QzetDb-u9NNWK88TdQsVWMLFky2DWsz_IM70GxmKC1KytMc-Zp4U-oDkoPH4SjNn56R2yAqys7NO3KBsAMm37-Oqjk04124a132LtpBNVMh0C7Uy92VSGyo5JKKhHKjjeSGGZw4x0T5ihjs36iQtm54qEKeSEyUswJYE6494NE9WMyGmdkHpLglRBDfy5vUteCRxt4ZSaT1rPBU1yCcnGisK8JxP_diEOMpL-mX06nB-VTkpWTb-G0xm72mOC9SHLacRxLTH-UO_ih3Civt3k0n7lx1rw9hFYsGK3MxR7CYj17NMSzrtzwdj04KLfwAeiPXBA
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3PS8MwFA4yRfTgb3H-zMGTUGiSJmuOQy2KY-wwdbeSpIkWZjfWKv75Jm03N1EPes8rIXl530v6ve8BcG6oxomvpBcSIr3AUONxialHQ59jXwpBSzGdh06r2w0HA96ruTl5Tat0d2hTCUWUsdod7nFipow4V8FtgS6wWBdyG05bNgIv27SZOQfvR4-fgZiGtQiz79nxZPpT87tPLMDSgmjpHNxEm_-c6BbYqPNM2K4cYxss6WwHrM-pD-6CdjuDaUkoTwvoGPG68gYohk-jSVo8v0A7P1iSzvU7tNdgC0uueh3WXWjyPXAfXfcvb7y6o4Kn7EWvsBsikCaCCcITwrTSgmmqUWLTEun4MMidUC5MoJkvfZYIhKWNAUhhphzckX3QyEaZPgBQMoMxx66SNwkUZ6FCLhVJhHGa8EQ1gT9d0FjVcuOu68UwRjNV0i-r0wQXM5NxpbXx22A6v0txUT5wmKobSUx-tDv8o90ZWO1dRXHntnt3BNYQb9HqIeYYNIrJqz4BK-qtSPPJaemDHwnp1bY
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+implicit+enumeration+algorithm+for+complex+scheduling+problems&rft.jtitle=International+journal+of+production+research&rft.au=FLORIAN%2C+M.&rft.au=TILQUIN%2C+C.&rft.au=TILQUIN%2C+G.&rft.date=1975-01-01&rft.issn=0020-7543&rft.eissn=1366-588X&rft.volume=13&rft.issue=1&rft.spage=25&rft.epage=40&rft_id=info:doi/10.1080%2F00207547508942972&rft.externalDBID=n%2Fa&rft.externalDocID=10_1080_00207547508942972
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-7543&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-7543&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-7543&client=summon