Scheduling deteriorating jobs subject to job or machine availability constraints-Reference-Cited by-同舟云学术

Scheduling deteriorating jobs subject to job or machine availability constraints

Published:2007-07 Issue:1 Volume:180 Page:472-478
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Gawiejnowicz Stanisław

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference7 articles.

1. A concise survey of scheduling with time-dependent scheduling times;Cheng;European Journal of Operational Research,2004

2. Computers and Intractability – A Guide to the Theory of NP-completeness;Garey,1979

3. The NP-completeness column: An ongoing guide;Johnson;Journal of Algorithms,1982

4. Combinatorial complexity of scheduling jobs with simple linear processing times;Kononov;Diskretny Analiz i Issledovanie Operatsii,1996

5. Scheduling jobs under simple linear deterioration;Mosheiov;Computers and Operations Research,1994

Cited by 71 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. New bounds for single-machine time-dependent scheduling with uniform deterioration;Theoretical Computer Science;2024-07

2. Single Machine Scheduling Proportionally Deteriorating Jobs with Ready Times Subject to the Total Weighted Completion Time Minimization;Mathematics;2024-02-19

3. Scheduling with periodic availability constraints to minimize makespan;Journal of Scheduling;2023-08-17

4. Scheduling problems with rejection and piece-rate maintenance to minimise the total weighted completion time;International Journal of Automation and Control;2022

5. Biobjective Scheduling for Joint Parallel Machines with Sequence-Dependent Setup by Taking Pareto-Based Approach;Modelling and Simulation in Engineering;2021-08-30