{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:32:40Z","timestamp":1759847560703},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2002,2]]},"DOI":"10.1016\/s0377-2217(01)00094-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:06:09Z","timestamp":1027591569000},"page":"37-49","source":"Crossref","is-referenced-by-count":14,"title":["Preemptive Hybrid Flowshop Scheduling problem of interval orders"],"prefix":"10.1016","volume":"137","author":[{"given":"Housni","family":"Djellab","sequence":"first","affiliation":[]},{"given":"Khaled","family":"Djellab","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(01)00094-7_BIB1","first-page":"10","article-title":"An extension of two machines sequencing problem","volume":"8","author":"Arthanari","year":"1971","journal-title":"Operational Research"},{"key":"10.1016\/S0377-2217(01)00094-7_BIB2","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0377-2217(91)90148-O","article-title":"Branch and bound algorithm for the flowshop with multiple processors","volume":"51","author":"Brah","year":"1991","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00094-7_BIB3","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-Tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"Journal of Computer and System Science"},{"issue":"2","key":"10.1016\/S0377-2217(01)00094-7_BIB4","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1057\/jors.1995.28","article-title":"Analysis of classes of heuristics for scheduling a two-stage flowshop with parallel machines at one stage","volume":"46","author":"Chen","year":"1995","journal-title":"Journal of Operational Research Society"},{"key":"10.1016\/S0377-2217(01)00094-7_BIB5","unstructured":"CPLEX base system, 1995, Version 4.0"},{"key":"10.1016\/S0377-2217(01)00094-7_BIB6","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/S0377-2217(98)00234-3","article-title":"Scheduling preemptive jobs with precedence constraints on parallel machines","volume":"117","author":"Djellab","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00094-7_BIB7","unstructured":"Dupont, L., Vignier, A., Portmann, M.-C., Proust, C., 1997. An efficient separation scheme to solve hybrid Flowshop scheduling problem. In: International Conference Industrial Engineering and Production Management, tome 1, Lyon, October 1998, pp. 23\u201343"},{"key":"10.1016\/S0377-2217(01)00094-7_BIB8","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: A survey","volume":"5","author":"Graham","year":"1979","journal-title":"Annals of Discrete Mathematics"},{"issue":"5","key":"10.1016\/S0377-2217(01)00094-7_BIB9","doi-asserted-by":"crossref","first-page":"1643","DOI":"10.1080\/00207549608904988","article-title":"A computational study of heuristics for two-stage flexible flowshop","volume":"34","author":"Guinet","year":"1996","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(01)00094-7_BIB10","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1057\/jors.1988.63","article-title":"Two stage, hybrid flowshop scheduling problem","volume":"39","author":"Gupta","year":"1988","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(01)00094-7_BIB11","unstructured":"Hoogeveen, J.A., Lenstra, J.K., Veltman, B., 1993. Minimizing makespan in a multiprocessor flowshop is strongly NP-Hard. Ph.D. Thesis, CWI, Amsterdam, The Netherlands"},{"key":"10.1016\/S0377-2217(01)00094-7_BIB12","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/S0377-2217(96)90070-3","article-title":"Preemptive scheduling in a two-stage multiprocessor Flowshop is NP-hard","volume":"89","author":"Hoogeveen","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00094-7_BIB13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","article-title":"Scheduling with deadlines and loss functions","volume":"6","author":"McNaughton","year":"1959","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(01)00094-7_BIB14","doi-asserted-by":"crossref","unstructured":"M\u00f6hring, R.H., 1985, Algorithmic aspects of comparability graphs and interval graphs. In: Rival, I. (Ed.), Graph and Order. Reidel, Dordrecht, pp. 41\u2013101","DOI":"10.1007\/978-94-009-5315-4_2"},{"key":"10.1016\/S0377-2217(01)00094-7_BIB15","doi-asserted-by":"crossref","unstructured":"Moursli, O., 1997. Branch and bound lower bounds for the hybrid flowshop. In: Workshop on Intelligent Manufacturing Systems, (IMS'97), Conference Proceedings, Seoul","DOI":"10.1016\/S1474-6670(17)42693-0"},{"key":"10.1016\/S0377-2217(01)00094-7_BIB16","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0377-2217(92)90310-6","article-title":"A multi-stage parallel-processor flowshop problem with minimum flow time","volume":"57","author":"Rajendran","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00094-7_BIB17","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1016\/0377-2217(93)E0326-S","article-title":"Global lower bounds for the Flowshops with multiple processors","volume":"80","author":"Santos","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00094-7_BIB18","unstructured":"Vandevelde, A.M.G., Hoogeveen, J.A., Hurkens, J.A., Lenstra, J.K., 1995. Lower bounds for the multiprocessor Flowshop. Working Paper, Eindhoven University of Technology, The Netherlands"},{"key":"10.1016\/S0377-2217(01)00094-7_BIB19","unstructured":"Vignier, A., 1997. Contribution \u00e0 la r\u00e9solution des probl\u00e8mes d'ordonnancement de type monogamme multimachine (Flow-shop hybride). Ph.D. Thesis, Tours, June 1997"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701000947?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701000947?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T09:52:00Z","timestamp":1556877120000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221701000947"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["S0377221701000947"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(01)00094-7","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}