Search Results - scheduling deteriorating job complexity theory fully polynomial-time approximation scheme*

Complexity and approximability of scheduling resumable proportionally deteriorating jobs

Authors: Gawiejnowicz, Stanisław Kononov, Alexander

Source: European Journal of Operational Research. Jan2010, Vol. 200 Issue 1, p305-308. 4p.

Subject Terms: *APPROXIMATION theory, *PRODUCTION scheduling, *MACHINERY, *OPERATIONS research, *MATHEMATICAL analysis, *MATHEMATICAL optimization, *DECISION making, COMPUTATIONAL complexity, POLYNOMIALS

Scheduling a variable maintenance and linear deteriorating jobs on a single machine.

Authors: Luo, Wenchang Ji, Min

Source: Information Processing Letters. Jan2015, Vol. 115 Issue 1, p33-39. 7p.

Subject Terms: *MACHINE theory, *PRODUCTION scheduling, POLYNOMIAL time algorithms, COMPUTATIONAL complexity, NP-hard problems

Scheduling deteriorating jobs with machine availability constraints to minimize the total completion time.

Authors: Zhao, Chuan-Li Hsu, Chou-Jung

Source: Journal of Industrial & Production Engineering; Jul2017, Vol. 34 Issue 5, p323-329, 7p

Subject Terms: MACHINE theory, PRODUCTION scheduling, MATHEMATICAL programming, PROBLEM solving, POLYNOMIALS

Scheduling linear deteriorating jobs with an availability constraint on a single machine

Authors: Ji, Min He, Yong Cheng, T.C.E.

Source: Theoretical Computer Science. Oct2006, Vol. 362 Issue 1-3, p115-126. 12p.

Subject Terms: *COMPUTATIONAL complexity, *ELECTRONIC data processing, *MACHINE theory, *PRODUCTION scheduling

Scheduling Deteriorating Jobs with Availability Constraints to Minimize the Makespan.

Authors: Zhao, Chuanli Tang, Hengyong

Source: Asia-Pacific Journal of Operational Research; Dec2016, Vol. 33 Issue 6, p-1, 10p

Subject Terms: POLYNOMIAL time algorithms, PRODUCTION scheduling, MACHINE learning, MATHEMATICAL functions, APPROXIMATION algorithms

Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan

Authors: Ji, Min Cheng, T.C.E.

Source: European Journal of Operational Research. Apr2010, Vol. 202 Issue 1, p90-98. 9p.

Subject Terms: *PRODUCTION scheduling, *APPROXIMATION theory, *PROBLEM solving, *MACHINE theory, *ALGORITHMS, COMPUTATIONAL complexity, POLYNOMIALS

Parallel-machine scheduling of deteriorating jobs with potential machine disruptions.

Authors: Yin, Yunqiang Wang, Yan Cheng, T.C.E. et al.

Source: Omega. Jun2017, Vol. 69, p17-28. 12p.

Subject Terms: *OCCUPATIONS, *MACHINERY, *ECONOMIC development, *APPROXIMATION theory, POLYNOMIAL time algorithms

Parallel-machine scheduling with deteriorating jobs, rejection and a fixed non-availability interval.

Authors: Zhang, Minjiao Luo, Chengxin

Source: Applied Mathematics & Computation. Nov2013, Vol. 224, p405-411. 7p.

Subject Terms: *MACHINE theory, *COMPUTER scheduling, *LINEAR systems, *POLYNOMIALS, *APPROXIMATION theory, *MATHEMATICAL bounds

Parallel-machine scheduling of simple linear deteriorating jobs

Authors: Ji, Min Cheng, T.C.E.

Source: Theoretical Computer Science. Sep2009, Vol. 410 Issue 38-40, p3761-3768. 8p.

Subject Terms: *PARALLEL computers, *PRODUCTION scheduling, *MECHANICAL loads, *POLYNOMIALS, *APPROXIMATION theory, *ALGORITHMS, *SCHEMES (Algebraic geometry), *COMPUTATIONAL complexity

Scheduling resumable simple linear deteriorating jobs on a single machine with an availability constraint to minimize makespan

Authors: Ji, Min Cheng, T.C.E.

Source: Computers & Industrial Engineering. Nov2010, Vol. 59 Issue 4, p794-798. 5p.

Subject Terms: *INTEGER programming, *MACHINE theory, *APPROXIMATION theory, CONSTRAINT satisfaction, COMPUTATIONAL complexity, COMPUTER scheduling, MATHEMATICAL proofs

SCHEDULING DETERIORATING JOBS ON A SINGLE MACHINE WITH RELEASE TIMES AND REJECTION.

Authors: LIU, MING ZHENG, FEIFENG CHU, CHENGBIN et al.

Source: Discrete Mathematics, Algorithms & Applications; Jun2012, Vol. 4 Issue 2, p-1, 9p

Partial dominated schedules and minimizing the total completion time of deteriorating jobs.

Authors: Ocetkiewicz, Krzysztof M.

Source: Optimization; Oct2013, Vol. 62 Issue 10, p1341-1356, 16p

Subject Terms: COMPUTER scheduling, PROBLEM solving, MATHEMATICAL bounds, ALGORITHMS, MACHINE theory, MATHEMATICAL analysis, NUMERICAL analysis

Scheduling deteriorating jobs to minimize makespan.

Authors: Kubiak, Wieslaw van de Velde, Steef

Source: Naval Research Logistics; Aug1998, Vol. 45 Issue 5, p511-523, 13p

Parallel-batching scheduling with two agents, release dates and equal processing times.

Authors: Li, Shi-Sheng Chen, Ren-Xia

Source: International Journal of Production Research; Dec2025, Vol. 63 Issue 24, p9799-9820, 22p

Subject Terms: SCHEDULING, PARETO optimum, NP-hard problems, BATCH processing, POLYNOMIAL time algorithms

Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times.

Authors: Shabtay, Dvir Mor, Baruch

Source: Journal of Scheduling; Jun2024, Vol. 27 Issue 3, p239-256, 18p

Subject Terms: FLOW shop scheduling, APPROXIMATION algorithms, FLOW shops, POLYNOMIAL approximation, POLYNOMIAL time algorithms

Scheduling on identical machines with preemption and setup times.

Authors: Haned, Amina Kerdali, Abida Boudhar, Mourad

Source: International Journal of Production Research; Jan2024, Vol. 62 Issue 1/2, p444-459, 16p

Subject Terms: SETUP time, POLYNOMIAL time algorithms, POLYNOMIAL approximation, DYNAMIC programming, GENETIC algorithms

Fully polynomial-time approximation scheme for single machine scheduling with proportional-linear deteriorating jobs.

Authors: Zhao, Chuanli Hsu, Chou-Jung

Source: Engineering Optimization; Nov2019, Vol. 51 Issue 11, p1938-1943, 6p

Subject Terms: TARDINESS, COMPUTER scheduling, DYNAMIC programming, MACHINING, OCCUPATIONS

Single machine scheduling with variable maintenance in the battery manufacturing.

Authors: Lee, Sang-Wook Kim, Hyun-Jung

Source: International Journal of Production Research; Dec2025, Vol. 63 Issue 23, p8859-8879, 21p

Subject Terms: LITHIUM-ion battery manufacturing, SCHEDULING, COMPUTER performance, HEURISTIC algorithms, COMPUTERIZED maintenance management systems, INTEGER programming, BRANCH & bound algorithms

Parallel Machines Scheduling with Deteriorating Maintenance Activities and Job Rejection.

Authors: Zou, Juan Sui, Yu-Kang Gao, Jie et al.

Source: Asia-Pacific Journal of Operational Research; Feb2023, Vol. 40 Issue 1, p1-23, 23p

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

Minimising the makespan on parallel identical machines with log-linear position-dependent processing times.

Authors: Cohen, Edut Shapira, Dana

Source: Journal of the Operational Research Society; Mar2025, Vol. 76 Issue 3, p581-589, 9p

Subject Terms: POLYNOMIAL time algorithms, POLYNOMIAL approximation, PRODUCTION scheduling, DYNAMIC programming, NP-hard problems