Suchergebnisse - Scheduling Deteriorating jobs Complexity theory Fully polynomial-time approximation scheme

Complexity and approximability of scheduling resumable proportionally deteriorating jobs

Autoren: Gawiejnowicz, Stanisław Kononov, Alexander

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

Schlagwörter: *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.

Autoren: Luo, Wenchang Ji, Min

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

Schlagwörter: *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.

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

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

Schlagwörter: MACHINE theory, PRODUCTION scheduling, MATHEMATICAL programming, PROBLEM solving, POLYNOMIALS

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

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

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

Schlagwörter: *COMPUTATIONAL complexity, *ELECTRONIC data processing, *MACHINE theory, *PRODUCTION scheduling

Scheduling Deteriorating Jobs with Availability Constraints to Minimize the Makespan.

Autoren: Zhao, Chuanli Tang, Hengyong

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

Schlagwörter: POLYNOMIAL time algorithms, PRODUCTION scheduling, MACHINE learning, MATHEMATICAL functions, APPROXIMATION algorithms

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

Autoren: Zhao, Chuanli Hsu, Chou-Jung

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

Schlagwörter: TARDINESS, COMPUTER scheduling, DYNAMIC programming, MACHINING, OCCUPATIONS

Scheduling with step-deteriorating jobs to minimize the makespan.

Autoren: Miao, Cuixia Zhang, Yuzhong

Quelle: Journal of Industrial & Management Optimization; Oct2019, Vol. 15 Issue 4, p1955-1964, 10p

Schlagwörter: COMPUTER scheduling, POLYNOMIAL approximation, POLYNOMIAL time algorithms, NP-hard problems

SINGLE-MACHINE SCHEDULING WITH PROPORTIONALLY DETERIORATING JOBS SUBJECT TO AVAILABILITY CONSTRAINTS.

Autoren: LI, SHISHENG FAN, BAOQIANG

Quelle: Asia-Pacific Journal of Operational Research; Aug2012, Vol. 29 Issue 4, p-1, 10p

Schlagwörter: PRODUCTION scheduling, OCCUPATIONS, PROBLEM solving, POLYNOMIAL time algorithms, APPROXIMATION theory

A fully polynomial-time approximation scheme for total completion time minimization on a single machine with DeJong's learning effect and an availability constraint.

Autoren: Bai, Mengzhuo Zhao, Yufang

Quelle: Engineering Optimization; Aug2020, Vol. 52 Issue 8, p1313-1322, 10p

Schlagwörter: COMPUTER scheduling, MACHINE learning, TIME

AN FPTAS FOR THE WEIGHTED NUMBER OF TARDY JOBS MINIMIZATION ON A SINGLE MACHINE WITH DETERIORATING JOBS.

Autoren: CHUANLI ZHAO

Quelle: Journal of Industrial & Management Optimization; Apr2017, Vol. 13 Issue 2, p587-593, 7p

Schlagwörter: PRODUCTION scheduling, POLYNOMIAL time algorithms, APPROXIMATION theory, DYNAMIC programming, NP-hard problems

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

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

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

Schlagwörter: *PRODUCTION scheduling, *APPROXIMATION theory, *PROBLEM solving, *MACHINE theory, *ALGORITHMS, COMPUTATIONAL complexity, POLYNOMIALS

SCHEDULING PROPORTIONALLY DETERIORATING JOBS IN TWO-MACHINE OPEN SHOP WITH A NON-BOTTLENECK MACHINE.

Autoren: LI, SHISHENG

Quelle: Asia-Pacific Journal of Operational Research; Oct2011, Vol. 28 Issue 5, p623-631, 9p

Schlagwörter: PRODUCTION scheduling, POLYNOMIALS, APPROXIMATION theory, NUMERICAL analysis, MANUFACTURING processes, OPERATIONS research, MATHEMATICAL models

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

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

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

Schlagwörter: *OCCUPATIONS, *MACHINERY, *ECONOMIC development, *APPROXIMATION theory, POLYNOMIAL time algorithms

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

Autoren: Zhang, Minjiao Luo, Chengxin

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

Schlagwörter: *MACHINE theory, *COMPUTER scheduling, *LINEAR systems, *POLYNOMIALS, *APPROXIMATION theory, *MATHEMATICAL bounds

Parallel-machine scheduling of simple linear deteriorating jobs

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

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

Schlagwörter: *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

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

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

Schlagwörter: *INTEGER programming, *MACHINE theory, *APPROXIMATION theory, CONSTRAINT satisfaction, COMPUTATIONAL complexity, COMPUTER scheduling, MATHEMATICAL proofs

An FPTAS for batch scheduling with deterioration effect.

Autoren: Liu, Ming Zheng, Feifeng Chu, Chengbin

Quelle: Proceedings of 2012 9th IEEE International Conference on Networking, Sensing & Control; 1/ 1/2012, p322-327, 6p

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

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

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

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

Autoren: Ocetkiewicz, Krzysztof M.

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

Schlagwörter: COMPUTER scheduling, PROBLEM solving, MATHEMATICAL bounds, ALGORITHMS, MACHINE theory, MATHEMATICAL analysis, NUMERICAL analysis

Scheduling deteriorating jobs to minimize makespan.

Autoren: Kubiak, Wieslaw van de Velde, Steef

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