{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,12]],"date-time":"2025-09-12T18:25:02Z","timestamp":1757701502082,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1109\/codit.2017.8102675","type":"proceedings-article","created":{"date-parts":[[2017,11,28]],"date-time":"2017-11-28T16:15:31Z","timestamp":1511885731000},"page":"0690-0695","source":"Crossref","is-referenced-by-count":3,"title":["A branch-and-bound algorithm for the two-machine flow-shop problem with time delays"],"prefix":"10.1109","author":[{"given":"Mohamed Amine","family":"Mkadem","sequence":"first","affiliation":[]},{"given":"Aziz","family":"Moukrim","sequence":"additional","affiliation":[]},{"given":"Mehdi","family":"Serairi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","article-title":"Flow and open shop scheduling on two machines with transportation times and machine-independant processing times is NP-hard","author":"dell'amico","year":"1996","journal-title":"Dipartimento di Economia politica Universitá di Modena"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1287\/opre.44.5.777"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TAI.1993.633935"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.5.3.293"},{"journal-title":"The two-machine flow shop problem and the one-machine total tardiness problem","year":"1996","author":"yu","key":"ref11"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800010110"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOSH.0000036858.59787.c2"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1051\/ro\/2014004"},{"key":"ref7","article-title":"Lower bounds for the two-machine flow shop problem with time delays","author":"mkadern","year":"2017","journal-title":"Operations Research Proceedings 2016"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF03543071","article-title":"A practical use of jackson's preemptive schedule for solving the job shop problem","volume":"26","author":"carlier","year":"1990","journal-title":"Annals of Operations Research"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2015.1099639"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90204-6"}],"event":{"name":"2017 4th International Conference on Control, Decision and Information Technologies (CoDIT)","start":{"date-parts":[[2017,4,5]]},"location":"Barcelona","end":{"date-parts":[[2017,4,7]]}},"container-title":["2017 4th International Conference on Control, Decision and Information Technologies (CoDIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8091148\/8102545\/08102675.pdf?arnumber=8102675","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,23]],"date-time":"2020-10-23T01:26:06Z","timestamp":1603416366000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8102675\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/codit.2017.8102675","relation":{},"subject":[],"published":{"date-parts":[[2017,4]]}}}