Search Results - Scheduling . Non-availability constraint . Approximation~

Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times Under Non-availability or Deadline Constraints

Authors: Kacem, Imed Kellerer, Hans KACEM, Imed

Contributors: Kacem, Imed Kellerer, Hans KACEM, Imed

Source: Algorithmica. 80:3825-3843

Subject Terms: FOS: Computer and information sciences, Single machine scheduling, Computer Science - Data Structures and Algorithms, 0211 other engineering and technologies, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], Lateness, 01 natural sciences, Deadlines, Approximation algorithms, Release times

Access URL: https://link.springer.com/content/pdf/10.1007/s00453-018-0417-6.pdf
http://arxiv.org/abs/1708.05102
https://hal.science/hal-03938890v1
https://doi.org/10.1007/s00453-018-0417-6
https://arxiv.org/abs/1708.05102
https://link.springer.com/article/10.1007/s00453-018-0417-6/fulltext.html
https://dblp.uni-trier.de/db/journals/corr/corr1708.html#abs-1708-05102
http://ui.adsabs.harvard.edu/abs/2017arXiv170805102K/abstract
https://link.springer.com/article/10.1007%2Fs00453-018-0417-6
https://link.springer.com/content/pdf/10.1007/s00453-018-0417-6.pdf

Scheduling resumable deteriorating jobs on a single machine with non-availability constraints

Authors: Li Zhou Baoqiang Fan Shisheng Li et al.

Source: Theoretical Computer Science. 412:275-280

Subject Terms: Non-availability constraint, Scheduling, Deteriorating job, 0211 other engineering and technologies, 02 engineering and technology, Fully polynomial-time approximation scheme, Theoretical Computer Science, Computer Science(all)

Access URL: https://dblp.uni-trier.de/db/journals/tcs/tcs412.html#FanLZZ11
https://www.sciencedirect.com/science/article/pii/S0304397510004962#!
https://www.sciencedirect.com/science/article/pii/S0304397510004962
https://core.ac.uk/display/82420989

Single machine scheduling with small operator-non-availability periods

Authors: Rapine, Christophe Brauner, Nadia Finke, Gerd et al.

Contributors: Rapine, Christophe Brauner, Nadia Finke, Gerd et al.

Source: Journal of Scheduling. 15:127-139

Subject Terms: unavailability constraints, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC], 0211 other engineering and technologies, forbidden start and end, 0102 computer and information sciences, 02 engineering and technology, One machine scheduling, approximation, 01 natural sciences

Access URL: http://hal.archives-ouvertes.fr/docs/00/36/47/57/PDF/article.pdf
https://dblp.uni-trier.de/db/journals/scheduling/scheduling15.html#RapineBFL12
https://doi.org/10.1007/s10951-012-0269-x
https://link.springer.com/article/10.1007%2Fs10951-012-0269-x
https://hal.archives-ouvertes.fr/hal-00364757
https://hal.archives-ouvertes.fr/hal-00364757/document

Keynote 5: 'Scheduling with non-availability constraints: Offline and semi-online scenarios'

Authors: Telmo R. Cunha Valérie Botta-Genoulaz Imed Kacem

Source: 2017 4th International Conference on Control, Decision and Information Technologies (CoDIT). :17-37

Access URL: https://ieeexplore.ieee.org/document/8102555/
https://dblp.uni-trier.de/db/conf/codit/codit2017.html#KacemCB17

Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval

Authors: Kacem, Imed Mahjoub, A. Ridha KACEM, Imed et al.

Contributors: Kacem, Imed Mahjoub, A. Ridha KACEM, Imed et al.

Source: Computers & Industrial Engineering. 56:1708-1712

Subject Terms: Programmation, Scheduling, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], 01 natural sciences, organisation des données, Weighted flow-time, Non-availibility constraint, FPTAS, Approximation, logiciels

Access URL: https://basepub.dauphine.fr/handle/123456789/3020
https://www.sciencedirect.com/science/article/pii/S036083520800257X

Parallel Machine Scheduling of Deteriorating Jobs With Rejection and An Availability Constraint.

Authors: Wu, Guanghua Liu, Huan Liang, Yongping et al.

Source: Journal of Mathematics; 7/25/2025, Vol. 2025, p1-11, 11p

Subject Terms: DYNAMIC programming, MACHINERY, SCHEDULING, ALGORITHMS

Approximation results for flow shop scheduling problems with machine availability constraints

Authors: Kubzin, Mikhail A. Potts, Chris N. Strusevich, Vitaly A.

Source: Computers & Operations Research. 36:379-390

Subject Terms: 0211 other engineering and technologies, 02 engineering and technology

File Description: text

Access URL: https://eprints.soton.ac.uk/149837/1/LimAvailE-Prints.pdf
https://core.ac.uk/display/24546
https://gala.gre.ac.uk/id/eprint/1301
https://eprints.soton.ac.uk/149837/
https://dblp.uni-trier.de/db/journals/cor/cor36.html#KubzinPS09
https://www.sciencedirect.com/science/article/pii/S0305054807002018
https://doi.org/10.1016/j.cor.2007.10.013
https://eprints.soton.ac.uk/149837/

Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times under Non-Availability or Deadline Constraints

Authors: Kacem, Imed Kellerer, Hans

Index Terms: Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/1708.05102

Polynomial‐time approximation schemes for two‐machine open shop scheduling with nonavailability constraints

Authors: Joachim Breit Vitaly A. Strusevich Mikhail A. Kubzin et al.

Source: Naval Research Logistics (NRL). 53:16-23

Subject Terms: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Access URL: https://gala.gre.ac.uk/3671/
https://onlinelibrary.wiley.com/doi/10.1002/nav.20122
https://ideas.repec.org/a/wly/navres/v53y2006i1p16-23.html

Effective algorithms for scheduling problems under non-availability constraints (Invited paper)

Authors: Imed Kacem

Source: 2nd International Conference on Systems and Computer Science. :162-169

Subject Terms: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Access URL: https://dblp.uni-trier.de/db/conf/icconscs/icconscs2013.html#Kacem13
https://hal.archives-ouvertes.fr/hal-01277994
http://ieeexplore.ieee.org/document/6632041/
https://doi.org/10.1109/IcConSCS.2013.6632041

Single Machine Scheduling with Rejection and a Non-Availability Interval to Minimize the Maximum Delivery Completion Time Plus the Total Rejection Cost.

Authors: Zuo, Lili Lu, Lingfa Zhang, Liqi

Source: Asia-Pacific Journal of Operational Research; Oct2023, Vol. 40 Issue 5, p1-11, 11p

Subject Terms: DYNAMIC programming, SCHEDULING, MACHINERY, LEAD time (Supply chain management), COST

Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals

Authors: Kacem, Imed Lanuel, Yann Kellerer, Hans et al.

Contributors: Kacem, Imed Lanuel, Yann Kellerer, Hans et al.

Source: Journal of Combinatorial Optimization. 30:403-412

Subject Terms: Late jobs, Scheduling, 13. Climate action, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], Non-availability intervals, 01 natural sciences, Approximation algorithms

Access URL: https://hal.inria.fr/hal-01277979
https://hal.archives-ouvertes.fr/hal-01277979
https://link.springer.com/article/10.1007/s10878-013-9643-7

Single-Machine Rescheduling with Rejection and an Operator No-Availability Period.

Authors: Wu, Guanghua Zhu, Hongli

Source: Mathematics (2227-7390); Dec2024, Vol. 12 Issue 23, p3678, 10p

Subject Terms: PRODUCTION scheduling, POLYNOMIAL time algorithms, POLYNOMIAL approximation, DYNAMIC programming, TARDINESS

No-wait scheduling of a two-machine flow-shop to minimise the makespan under non-availability constraints and different release dates.

Authors: Ben Chihaoui, Faten Kacem, Imed Hadj-Alouane, AtidelB. et al.

Source: International Journal of Production Research; Nov2011, Vol. 49 Issue 21, p6273-6286, 14p, 1 Diagram, 11 Charts

Subject Terms: PRODUCTION scheduling, BRANCH & bound algorithms, OPERATIONS research, MACHINE tools, MAINTENANCE, DYNAMIC programming

Heuristic algorithms for scheduling intrees on m machines with non-availability constraints.

Authors: Ben Abdellafou, Khaoula Hadda, Hatem Korbaa, Ouajdi

Source: Operational Research; Mar2021, Vol. 21 Issue 1, p55-71, 17p

Three-Stage Assembly Flow Shop Scheduling Problem with a Fixed Maintenance Period.

Authors: Yuan, Yuan Han, Xin Zhou, Yong et al.

Source: Asia-Pacific Journal of Operational Research; Oct2023, Vol. 40 Issue 5, p1-17, 17p

Subject Terms: FLOW shop scheduling, APPROXIMATION algorithms, SHIFT systems

Approximation schemes for scheduling jobs on identical parallel machines to minimize the maximum lateness and makespan.

Authors: Alhadi, Gais Kacem, Imed Laroche, Pierre et al.

Source: RAIRO: Operations Research (2804-7303); 2024, Vol. 58 Issue 3, p2393-2419, 27p

Subject Terms: TARDINESS, PRODUCTION scheduling, POLYNOMIAL approximation, DYNAMIC programming, SCHEDULING, POLYNOMIAL time algorithms

Effective algorithms for scheduling problems under non-availability constraints (Invited paper).

Authors: Kacem, Imed

Source: 2nd International Conference on Systems & Computer Science; 2013, p162-169, 8p

Non-preemptive two-machine open shop scheduling with non-availability constraints.

Authors: Breit, J. Schmidt, G. Strusevich, V. A.

Source: Mathematical Methods of Operations Research; 2003, Vol. 57 Issue 2, p217, 18p

Subject Terms: MACHINERY, PRODUCTION scheduling, ALGORITHMS

Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability interval

Authors: Kacem, Imed¹ imed.kacem@utt.fr

Source: Computers & Industrial Engineering. Apr2008, Vol. 54 Issue 3, p401-410. 10p.

Subject Terms: *ALGORITHMS, *PRODUCTION scheduling, *JOB analysis, POLYNOMIALS