Suchergebnisse - "Fully polynomial-time approximation scheme"

Approximation schemes for single-machine scheduling with a fixed maintenance activity to minimize the total amount of late work von Yin, Yunqiang, Xu, Jianyou, Cheng, T. C. E., Wu, Chin-Chia, Wang, Du-Juan

“… We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed …”
Volltext

Assortment optimization under the multinomial logit choice model with product-specific capacities von Huh, Woonghee Tim, Liu, Siyue

“… We consider assortment optimization with product-specific capacities under the multinomial logit (MNL) choice model, wherein each product has a finite …”
Volltext

Packing squares independently von Wu, Wei, Numaguchi, Hiroki, Halman, Nir, Hu, Yannan, Yagiura, Mutsunori

“… Given a set of squares and a strip with bounded width and infinite height, we consider a square strip packaging problem, which we call the square independent …”
Volltext

Single machine scheduling with release dates and rejection von Zhang, Liqi, Lu, Lingfa, Yuan, Jinjiang

“… In this paper, we consider the single machine scheduling problem with release dates and rejection. A job is either rejected, in which case a rejection penalty …”
Volltext

Parallel-machine scheduling of deteriorating jobs with potential machine disruptions von Yin, Yunqiang, Wang, Yan, Cheng, T.C.E., Liu, Wenqi, Li, Jinhai

“… We consider parallel-machine scheduling of deteriorating jobs in a disruptive environment in which some of the machines will become unavailable due to …”
Volltext

Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date von Chen, Xin, Liang, Yage, Sterna, Małgorzata, Wang, Wen, Błażewicz, Jacek

“… •Fully polynomial time approximation scheme for early work maximization is proposed.•The new FPTAS dominates PTAS for the two-machine case known from the …”
Volltext

Alternative algorithms for identical machines scheduling to maximize total early work with a common due date von Chen, Xin, Shen, Xuefeng, Kovalyov, Mikhail Y., Sterna, Malgorzata, Blazewicz, Jacek

“… We study a scheduling problem with a given number of identical parallel machines, a common job due date and the total early work criterion, i.e., …”
Volltext

Minimum shared‐power edge cut von Cabello, Sergio, Jain, Kshitij, Lubiw, Anna, Mondal, Debajyoti

“… We introduce a problem called minimum shared‐power edge cut (MSPEC). The input to the problem is an undirected edge‐weighted graph with distinguished vertices …”
Volltext

A fully polynomial time approximation scheme for the probability maximizing shortest path problem von Lee, Jisun, Joung, Seulgi, Lee, Kyungsik

“… •Algorithms for the probability maximizing shortest path problem are proposed.•Pseudo polynomially or polynomially solvable special cases are identified.•A …”
Volltext

Two-agent single-machine scheduling to minimize the batch delivery cost von Yin, Yunqiang, Wang, Yan, Cheng, T.C.E., Wang, Du-Juan, Wu, Chin-Chia

“… •Integrated production and batch delivery scheduling with two agents is considered.•Constrained optimization problems on various criteria of the two agents are …”
Volltext

Single-machine scheduling with operator non-availability to minimize total weighted completion time von Wan, Long, Yuan, Jinjiang

“… In this paper, we investigate the single-machine scheduling with an operator non-availability period to minimize total weighted completion time, where the …”
Volltext

Complexity and approximability of scheduling resumable proportionally deteriorating jobs von Gawiejnowicz, Stanisław, Kononov, Alexander

“… A set of independent, resumable and proportionally deteriorating jobs is to be executed on a single machine. The machine is not continuously available for …”
Volltext

Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval von Yin, Yunqiang, Ye, Deshi, Zhang, Guochuan

“… This paper addresses the problem of scheduling n nonresumable and simultaneously available jobs on a single machine, where the machine has a fixed …”
Volltext

A fully polynomial time approximation scheme for the Replenishment Storage problem von Hochbaum, Dorit S., Rao, Xu

“… The Replenishment Storage problem (RSP) is to minimize the storage capacity requirement for a deterministic demand, multi-item inventory system with specified …”
Volltext

An FPTAS for the parallel two-stage flowshop problem von Dong, Jianming, Tong, Weitian, Luo, Taibo, Wang, Xueshi, Hu, Jueliang, Xu, Yinfeng, Lin, Guohui

“… We consider the NP-hard m-parallel two-stage flowshop problem, abbreviated as the (m,2)-PFS problem, where we need to schedule n jobs to m parallel identical …”
Volltext

Rescheduling on identical parallel machines with machine disruptions to minimize total completion time von Yin, Yunqiang, Cheng, T.C.E., Wang, Du-Juan

“… •Rescheduling with machine disruptions on identical parallel machines is studied.•The trade-off between the disruption cost and scheduling criterion is …”
Volltext

Penalty cost constrained identical parallel machine scheduling problem von Li, Weidong, Li, Jianping, Zhang, Xuejie, Chen, Zhibin

“… We consider a version of parallel machine scheduling with rejection. An instance of the problem is given by m identical parallel machines and a set of n …”
Volltext

The prize-collecting single machine scheduling with bounds and penalties von Hu, Guojun, Pan, Pengxiang, Liu, Suding, Yang, Ping, Xie, Runtao

“… This study investigates the prize-collecting single machine scheduling with bounds and penalties (PC-SMS-BP). In this problem, a set of n jobs and a single …”
Volltext

Single-machine scheduling and common due date assignment with potential machine disruption von Xiong, Xiaoyun, Wang, Dujuan, Edwin Cheng, T.C., Wu, Chin-Chia, Yin, Yunqiang

“… This paper studies a single-machine due date assignment and scheduling problem in a disruptive environment, where a machine disruption may occur at a …”
Volltext

Improved Approximation Schemes for Early Work Scheduling on Identical Parallel Machines with a Common Due Date von Li, Wei-Dong

“… We study the early work scheduling problem on identical parallel machines in order to maximize the total early work, i.e., the parts of non-preemptive jobs …”
Volltext