Výsledky vyhľadávania - scheduling deteriorating job complexity theory fully polynomial-time approximation scheme~

Complexity and approximability of scheduling resumable proportionally deteriorating jobs

Autori: Gawiejnowicz, Stanisław Kononov, Alexander

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

Predmety: *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.

Autori: Luo, Wenchang Ji, Min

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

Predmety: *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.

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

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

Predmety: MACHINE theory, PRODUCTION scheduling, MATHEMATICAL programming, PROBLEM solving, POLYNOMIALS

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

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

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

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

Scheduling Deteriorating Jobs with Availability Constraints to Minimize the Makespan.

Autori: Zhao, Chuanli Tang, Hengyong

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

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

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

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

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

Predmety: 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.

Autori: Shabtay, Dvir Mor, Baruch

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

Predmety: FLOW shop scheduling, APPROXIMATION algorithms, FLOW shops, POLYNOMIAL approximation, POLYNOMIAL time algorithms

Scheduling on identical machines with preemption and setup times.

Autori: Haned, Amina Kerdali, Abida Boudhar, Mourad

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

Predmety: 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.

Autori: Zhao, Chuanli Hsu, Chou-Jung

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

Predmety: TARDINESS, COMPUTER scheduling, DYNAMIC programming, MACHINING, OCCUPATIONS

Parallel Machines Scheduling with Deteriorating Maintenance Activities and Job Rejection.

Autori: Zou, Juan Sui, Yu-Kang Gao, Jie a ďalší

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

Predmety: POLYNOMIAL time algorithms, POLYNOMIAL approximation, SCHEDULING, TARDINESS, PRODUCTION scheduling

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

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

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

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

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

Autori: Cohen, Edut Shapira, Dana

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

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

Scheduling with step-deteriorating jobs to minimize the makespan.

Autori: Miao, Cuixia Zhang, Yuzhong

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

Predmety: COMPUTER scheduling, POLYNOMIAL approximation, POLYNOMIAL time algorithms, NP-hard problems

Rescheduling with New Orders Under Bounded Disruption.

Autori: Lendl, Stefan Pferschy, Ulrich Rener, Elena

Zdroj: INFORMS Journal on Computing; Nov/Dec2024, Vol. 36 Issue 6, p1654-1675, 22p

Predmety: POLYNOMIAL time algorithms, APPROXIMATION algorithms, POLYNOMIAL approximation, SEARCH algorithms, DYNAMIC programming, COMPUTER scheduling

Single-Machine Time-Dependent Scheduling with Proportional and Delivery Times.

Autori: Miao, Cuixia Song, Jiaxin Zhang, Yuzhong

Zdroj: Asia-Pacific Journal of Operational Research; Aug2023, Vol. 40 Issue 4, p1-12, 12p

Predmety: POLYNOMIAL approximation, POLYNOMIAL time algorithms, NP-hard problems, SCHEDULING

Due date assignment and scheduling on a single machine with two competing agents.

Autori: Wang, Du-Juan Yin, Yunqiang Cheng, Shuenn-Ren a ďalší

Zdroj: International Journal of Production Research; Feb2016, Vol. 54 Issue 4, p1152-1169, 18p

Predmety: PRODUCTION scheduling, MATHEMATICAL optimization, DYNAMIC programming, MATHEMATICAL programming, APPROXIMATION theory, PRODUCTION control

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

Autori: LI, SHISHENG FAN, BAOQIANG

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

Predmety: PRODUCTION scheduling, OCCUPATIONS, PROBLEM solving, POLYNOMIAL time algorithms, APPROXIMATION theory

Multiple identical serial-batch machines scheduling with release dates and submodular rejection penalties.

Autori: Geng, Zhichao Lu, Lingfa

Zdroj: Journal of Combinatorial Optimization; Mar2025, Vol. 49 Issue 2, p1-27, 27p

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

Autori: Zuo, Lili Lu, Lingfa Zhang, Liqi

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

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

Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work.

Autori: Guo, Shuen Lu, Lingfa Yuan, Jinjiang a ďalší

Zdroj: Naval Research Logistics; Aug2022, Vol. 69 Issue 5, p816-837, 22p

Predmety: POLYNOMIAL time algorithms, COMPUTATIONAL complexity, NP-hard problems, DYNAMIC programming, WORKING hours