{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T18:43:37Z","timestamp":1729622617199,"version":"3.28.0"},"reference-count":25,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1109\/icnsc.2013.6548769","type":"proceedings-article","created":{"date-parts":[[2013,7,9]],"date-time":"2013-07-09T14:57:54Z","timestamp":1373381874000},"page":"388-391","source":"Crossref","is-referenced-by-count":0,"title":["Differential approximation analysis of Jackson's rule for single-machine scheduling problem with a fixed non-availability interval"],"prefix":"10.1109","author":[{"given":"I.","family":"Kacem","sequence":"first","affiliation":[]},{"given":"A.","family":"Nagih","sequence":"additional","affiliation":[]},{"given":"M.","family":"Seifaddini","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","article-title":"Machine schedulingwith an availability constraints","author":"lee","year":"2004","journal-title":"Handbook of Scheduling Algorithms Models and Performance Analysis"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1060.0301"},{"key":"18","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/BF00121681","article-title":"Machine schedulingwith an availability constraints","volume":"9","author":"lee","year":"1996","journal-title":"J Glob Optim"},{"key":"15","article-title":"Efficient branch-and-bound algorithm for mini-mizing the weighted sum of completion times on a sigle machine with one availability constraint","author":"kacem","year":"2007","journal-title":"Int J Prod Econ"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2012.11.002"},{"journal-title":"Analyse au pire cas de l'algorithme de Schrage appliqu au problme de minimisation du makespan sur une seule machine avec une contrainte d'indisponibilit","year":"2005","author":"kacem","key":"13"},{"key":"14","article-title":"Worst-case analysis of the WST and MWSPT rules for single machine scheduling with one planned setup period","author":"kacem","year":"2006","journal-title":"Eur J Oper Res"},{"key":"11","article-title":"Approximation algorithm for the weighted flowtime minimization on a single machine with a fixed non-availability interval","author":"kacem","year":"2007","journal-title":"Comput Ind Eng"},{"journal-title":"Fully Polynomial Approximation Schemes for the Weighted Flowtime Minimization under Unavailability Constraint","year":"2007","author":"kacem","key":"12"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1287\/opre.28.6.1436"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(01)00287-3"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2006.06.005"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600791"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(98)00367-1"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581085"},{"key":"3","first-page":"410","volume":"57","author":"chen","year":"2006","journal-title":"Minimizing Total Flow Time in the Single-machine Scheduling Problem with Periodic Maintenance J Oper Res Soc"},{"key":"2","first-page":"42","volume":"11","author":"calier","year":"1982","journal-title":"The One Machine Sequencing Problem Eue J Oper Res"},{"key":"10","article-title":"Scheduling a production line to minimize maximum tardiness","volume":"43","author":"jackson","year":"1955","journal-title":"Management Science Research Project Research Report"},{"key":"1","first-page":"1366153","author":"ausiello","year":"1980","journal-title":"Structure Preserving Reduc-tions among Convex Optimization Problems J Comput System Sci 21"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1287\/moor.17.1.22"},{"journal-title":"Approximation Algorithm for NP-hard Problems Chapter 1 PWS Publishing Company","year":"1997","author":"hall","key":"6"},{"key":"5","first-page":"63","volume":"148","author":"gharbi","year":"2005","journal-title":"Optimal Parallel Machines Scheduling with Availability Constraints Discrete Appl Math"},{"key":"4","first-page":"117","volume":"158","author":"demange","year":"1996","journal-title":"An Approximation Measure Founded on the Links between Optimization and Polynomial Approximation Theory Theoret Comput Sci"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2001.1187"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.04.014"}],"event":{"name":"2013 IEEE 10th International Conference on Networking, Sensing and Control (ICNSC 2013)","start":{"date-parts":[[2013,4,10]]},"location":"Evry","end":{"date-parts":[[2013,4,12]]}},"container-title":["2013 10th IEEE INTERNATIONAL CONFERENCE ON NETWORKING, SENSING AND CONTROL (ICNSC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6530812\/6548700\/06548769.pdf?arnumber=6548769","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T15:58:06Z","timestamp":1498060686000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6548769\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/icnsc.2013.6548769","relation":{},"subject":[],"published":{"date-parts":[[2013,4]]}}}