Suchergebnisse - "pseudo- polynomial time algorithm"

Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system von Shabtay, Dvir

“… We study a set of scheduling problems in a distributed flow‐shop scheduling system consisting of several flow‐shop production systems (factories) working in …”
Volltext

Single-machine scheduling with machine unavailability periods and resource dependent processing times von Shabtay, Dvir

“… •We study a single-machine scheduling problem with a machine-unavailability period.•Processing times are resource-dependent.•The problem is known to be …”
Volltext

Faster Minimization of Tardy Processing Time on a Single Machine von Bringmann, Karl, Fischer, Nick, Hermelin, Danny, Shabtay, Dvir, Wellnitz, Philip

“… This paper is concerned with the 1 | | ∑ p j U j problem, the problem of minimizing the total processing time of tardy jobs on a single machine. This is not …”
Volltext

Scheduling problems with rejection in green manufacturing industry von Kong, Fanyu, Song, Jiaxin, Miao, Cuixia, Zhang, Yuzhong

“… Green manufacturing is used to describe an environmentally friendly manufacturing approach, which explicitly considers the impact of production on the …”
Volltext

Two-agent parallel-machine scheduling with rejection von Li, Dawei, Lu, Xiwen

“… We study the two-agent scheduling with rejection on two parallel machines. There are two competing agents A and B with job families JA and JB, respectively. A …”
Volltext

Efficient Folding Algorithms for Convex Polyhedra von Kamata, Tonan, Kadoguchi, Akira, Horiyama, Takashi, Uehara, Ryuhei

“… We investigate a folding problem that inquires whether a polygon P can be folded, without overlap or gaps, onto a polyhedron Q for given P and  Q . An …”
Volltext

Scheduling with step learning and job rejection: Scheduling with step learning and job rejection von Song, Jiaxin, Miao, Cuixia, Kong, Fanyu

“… This paper focuses on job scheduling with step learning and job rejection. The step learning model aims to reduce the processing time for jobs starting after a …”
Volltext

Multitasking scheduling with alternate periods von Huo, Yujia, Miao, Cuixia, Kong, Fanyu, Zhang, Yuzhong

“… In this paper, we consider the multitasking scheduling with alternate odd-period and even-period. For the minimization of makespan on one single machine, we …”
Volltext

The single machine scheduling problem with setup times under an extension of the general learning and forgetting effects von Muştu, Settar, Eren, Tamer

“… This paper addresses the optimization of a single machine scheduling problem with additional constraints which are sequence-independent setup times and …”
Volltext

Proportionate flow-shop scheduling with rejection von Shabtay, Dvir, Oron, Daniel

“… In many heavily loaded manufacturing systems, managers routinely make use of outsourcing options in order to maintain reasonable Quality of Service for …”
Volltext

Two-agent scheduling with rejection on a single machine von Feng, Qi, Fan, Baoqiang, Li, Shisheng, Shang, Weiping

“… In this paper, we consider the two-agent scheduling problem with rejection on a single machine. In the problem we have two agents A and B with job families JA …”
Volltext

The just-in-time scheduling problem in a flow-shop scheduling system von Shabtay, Dvir

“… ► We study several variants of the problem of maximizing the weighted number of JIT jobs in a flow-shop scheduling system. ► We show that the unweighted …”
Volltext

Two-stage medical supply chain scheduling with an assignable common due window and shelf life von Zhang, Long, Zhang, Yuzhong, Bai, Qingguo

“… This paper considers a two-stage medical supply chain scheduling problem from the perspective of the medicine manufacturer in which jobs have an assignable …”
Volltext

Approximation algorithm for the balanced 2-connected k-partition problem von Wu, Di, Zhang, Zhao, Wu, Weili

“… For two positive integers m,k and a connected graph G=(V,E) with a nonnegative vertex weight function w, the balanced m-connected k-partition problem, denoted …”
Volltext

Supply chain scheduling with receiving deadlines and non-linear penalty von Wang, Gang, Lei, Lei, Lee, Kangbok

“… We study the operations scheduling problem with delivery deadlines in a three-stage supply chain process consisting of (1) heterogeneous suppliers, (2) …”
Volltext

Two-machine flow-shop scheduling with rejection von Shabtay, Dvir, Gasper, Nufar

“… We study a scheduling problem with rejection on a set of two machines in a flow-shop scheduling system. We evaluate the quality of a solution by two criteria: …”
Volltext

A bicriteria approach to maximize the weighted number of just-in-time jobs and to minimize the total resource consumption cost in a two-machine flow-shop scheduling system von Shabtay, Dvir, Bensoussan, Yaron, Kaspi, Moshe

“… We analyze a two-machine flow-shop scheduling problem in which the job processing times are controllable by the allocation of resources to the job operations …”
Volltext

A pseudo-polynomial time algorithm for solving the resource dependent assignment problem von Shabtay, Dvir, Steiner, George, Yedidsion, Liron

“… In this paper the resource dependent assignment problem (RDAP) is considered. In the RDAP the cost of assigning agent j to task i is a multiplication of task …”
Volltext

A bicriteria approach to scheduling a single machine with job rejection and positional penalties von Shabtay, Dvir, Gaspar, Nufar, Yedidsion, Liron

“… Single machine scheduling problems have been extensively studied in the literature under the assumption that all jobs have to be processed. However, in many …”
Volltext

Max-min weight balanced connected partition von Wang, Lele, Zhang, Zhao, Wu, Di, Wu, Weili, Fan, Lidan

“… For a connected graph and a positive integral vertex weight function , a max-min weight balanced connected -partition of , denoted as , is a partition of into …”
Volltext