2,878 research outputs found
Optimal Algorithms for Scheduling under Time-of-Use Tariffs
We consider a natural generalization of classical scheduling problems in
which using a time unit for processing a job causes some time-dependent cost
which must be paid in addition to the standard scheduling cost. We study the
scheduling objectives of minimizing the makespan and the sum of (weighted)
completion times. It is not difficult to derive a polynomial-time algorithm for
preemptive scheduling to minimize the makespan on unrelated machines. The
problem of minimizing the total (weighted) completion time is considerably
harder, even on a single machine. We present a polynomial-time algorithm that
computes for any given sequence of jobs an optimal schedule, i.e., the optimal
set of time-slots to be used for scheduling jobs according to the given
sequence. This result is based on dynamic programming using a subtle analysis
of the structure of optimal solutions and a potential function argument. With
this algorithm, we solve the unweighted problem optimally in polynomial time.
For the more general problem, in which jobs may have individual weights, we
develop a polynomial-time approximation scheme (PTAS) based on a dual
scheduling approach introduced for scheduling on a machine of varying speed. As
the weighted problem is strongly NP-hard, our PTAS is the best possible
approximation we can hope for.Comment: 17 pages; A preliminary version of this paper with a subset of
results appeared in the Proceedings of MFCS 201
is the answer in online weighted throughput maximization
We study a fundamental online scheduling problem where jobs with processing
times, weights, and deadlines arrive online over time at their release dates.
The task is to preemptively schedule these jobs on a single or multiple
(possibly unrelated) machines with the objective to maximize the weighted
throughput, the total weight of jobs that complete before their deadline. To
overcome known lower bounds for the competitive analysis, we assume that each
job arrives with some slack ; that is, the time window for
processing job on any machine on which it can be executed has length at
least times 's processing time on machine . Our
contribution is a best possible online algorithm for weighted throughput
maximization on unrelated machines: Our algorithm is
-competitive, which matches the lower bound for
unweighted throughput maximization on a single machine. Even for a single
machine, it was not known whether the problem with weighted jobs is "harder"
than the problem with unweighted jobs. Thus, we answer this question and close
weighted throughput maximization on a single machine with a best possible
competitive ratio . While we focus on
non-migratory schedules, our algorithm achieves the same (up to constants)
performance guarantee when compared to an optimal migratory schedule
Order Acceptance and Scheduling: A Taxonomy and Review
Over the past 20 years, the topic of order acceptance has attracted considerable attention from those who study scheduling and those who practice it. In a firm that strives to align its functions so that profit is maximized, the coordination of capacity with demand may require that business sometimes be turned away. In particular, there is a trade-off between the revenue brought in by a particular order, and all of its associated costs of processing. The present study focuses on the body of research that approaches this trade-off by considering two decisions: which orders to accept for processing, and how to schedule them. This paper presents a taxonomy and a review of this literature, catalogs its contributions and suggests opportunities for future research in this area
Optimal Algorithms for Scheduling under Time-of-Use Tariffs
We consider a natural generalization of classical scheduling problems in which using a time unit for processing a job causes some time-dependent cost which must be paid in addition to the standard scheduling cost. We study the scheduling objectives of minimizing the makespan and the sum of (weighted) completion times. It is not difficult to derive a polynomial-time algorithm for preemptive scheduling to minimize the makespan on unrelated machines. The problem of minimizing the total (weighted) completion time is considerably harder, even on a single machine. We present a polynomial-time algorithm that computes for any given sequence of jobs an optimal schedule, i.e., the optimal set of time-slots to be used for scheduling jobs according to the given sequence. This result is based on dynamic programming using a subtle analysis of the structure of optimal solutions and a potential function argument. With this algorithm, we solve the unweighted problem optimally in polynomial time. For the more general problem, in which jobs may have individual weights, we develop a polynomial-time approximation scheme (PTAS) based on a dual scheduling approach introduced for scheduling on a machine of varying speed. As the weighted problem is strongly NP-hard, our PTAS is the best possible approximation we can hope for
Optimal Algorithms for Scheduling under Time-of-Use Tariffs
We consider a natural generalization of classical scheduling problems in which using a time unit for processing a job causes some time-dependent cost which must be paid in addition to the standard scheduling cost. We study the scheduling objectives of minimizing the makespan and the sum of (weighted) completion times. It is not difficult to derive a polynomial-time algorithm for preemptive scheduling to minimize the makespan on unrelated machines. The problem of minimizing the total (weighted) completion time is considerably harder, even on a single machine. We present a polynomial-time algorithm that computes for any given sequence of jobs an optimal schedule, i.e., the optimal set of time-slots to be used for scheduling jobs according to the given sequence. This result is based on dynamic programming using a subtle analysis of the structure of optimal solutions and a potential function argument. With this algorithm, we solve the unweighted problem optimally in polynomial time. For the more general problem, in which jobs may have individual weights, we develop a polynomial-time approximation scheme (PTAS) based on a dual scheduling approach introduced for scheduling on a machine of varying speed. As the weighted problem is strongly NP-hard, our PTAS is the best possible approximation we can hope for
Project portfolio management: capacity allocation, downsizing decisions and sequencing rules.
This paper aims to gain insight into capacity allocation, downsizing decisions and sequencing rules when managing a portfolio of projects. By downsizing, we mean reducing the scale or size of a project and thereby changing the project's content. In previous work, we have determined the amount of critical capacity that is optimally allocated to concurrently executed projects with deterministic or stochastic workloads when the impact of downsizing is known. In this paper, we extend this view with the possibility of sequential processing, which implies that a complete order is imposed on the projects. When projects are sequenced instead of executed in parallel, two effects come into play: firstly, unused capacity can be shifted to later projects in the same period; and secondly, reinvestment revenues gain importance because of the differences in realization time of the sequenced projects. When project workloads are known, only the second effect counts; when project workloads are stochastic, however, the project's capacity usage is uncertain so that unused capacity can be shifted to later projects in the same period. In this case, both effects need to be taken into account. In this paper, we determine optimal sequencing rules when the selection and capacity-allocation decisions for a set of projects have already been made. We also consider a combination of parallel and sequential planning and we perform simulation experiments that confirm the appropriateness of our capacity-allocation methods.Project portfolio management; Downsizing; Sequencing;
Dagstuhl Reports : Volume 1, Issue 2, February 2011
Online Privacy: Towards Informational Self-Determination on the Internet (Dagstuhl Perspectives Workshop 11061) : Simone Fischer-HĂŒbner, Chris Hoofnagle, Kai Rannenberg, Michael Waidner, Ioannis Krontiris and Michael Marhöfer Self-Repairing Programs (Dagstuhl Seminar 11062) : Mauro PezzĂ©, Martin C. Rinard, Westley Weimer and Andreas Zeller Theory and Applications of Graph Searching Problems (Dagstuhl Seminar 11071) : Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer and Dimitrios M. Thilikos Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081) : Maxime Crochemore, Lila Kari, Mehryar Mohri and Dirk Nowotka Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091) Klaus Jansen, Claire Mathieu, Hadas Shachnai and Neal E. Youn
04231 Abstracts Collection -- Scheduling in Computer and Manufacturing Systems
During 31.05.-04.06.04, the Dagstuhl Seminar 04231 "Scheduling in Computer and Manufacturing Systems" was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available
- âŠ