scientific article; zbMATH DE number 2109192
From MaRDI portal
Publication:4821818
zbMath1103.90002MaRDI QIDQ4821818
No author found.
Publication date: 21 October 2004
Full work available at URL: http://www.crcnetbase.com/isbn/9780203489802
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to operations research and mathematical programming (90-00)
Related Items
Scheduling shared continuous resources on many-cores, Semi-online scheduling on two identical machines with a common due date to maximize total early work, Minimizing total weighted tardiness for scheduling equal-length jobs on a single machine, Measuring the impact of adversarial errors on packet scheduling strategies, A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job, Online production planning to maximize the number of on-time orders, Parametric analysis of the quality of single preemption schedules on three uniform parallel machines, Scheduling the part supply of mixed-model assembly lines in line-integrated supermarkets, Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time, A parallel machine schedule updating game with compensations and clients averse to uncertain loss, Novel dual discounting functions for the Internet shopping optimization problem: new algorithms, On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: minimizing the makespan and delivery cost, A MILP model for the teacher assignment problem considering teachers' preferences, Modeling the parallel machine scheduling problem with step deteriorating jobs, Minimising maximum response time, A mixed integer programming approach for the single machine problem with unequal release dates, Energy-oriented scheduling based on evolutionary algorithms, Mathematical models and algorithms for a high school timetabling problem, A note on ``Two-machine flow-shop scheduling with rejection and its link with flow-shop scheduling and common due date assignment, Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies, Multi-class, multi-resource advance scheduling with no-shows, cancellations and overbooking, Heuristics for the mirrored traveling tournament problem, On the NP-hardness of scheduling with time restrictions, Decentralized list scheduling, Scheduling of coupled tasks with unit processing times, A computational study of a cutting plane algorithm for university course timetabling, Simple matching vs linear assignment in scheduling models with positional effects: a critical review, Scheduling problems with partially ordered jobs, A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines, Joint production and preventive maintenance scheduling for a single degraded machine by considering machine failures, Breaks, cuts, and patterns, Integer preemptive scheduling on parallel machines, The price of anarchy on uniformly related machines revisited, Properties of optimal schedules in preemptive shop scheduling, Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates, Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs, Real-time scheduling to minimize machine busy times, Fault tolerant scheduling of tasks of two sizes under resource augmentation, Optimizing performance and reliability on heterogeneous parallel systems: approximation algorithms and heuristics, An effective approximation algorithm for the malleable parallel task scheduling problem, Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs, Modelling and solving grid resource allocation problem with network resources for workflow applications, Load-balancing spatially located computations using rectangular partitions, Scheduling performance evaluation of logistics service supply chain based on the dynamic index weight, Online scheduling on a single machine with grouped processing times, Minimizing the makespan in nonpreemptive parallel machine scheduling problem, Optimizing busy time on parallel machines, Online optimization of busy time on parallel machines, Practices in timetabling in higher education institutions: a systematic review, Scheduling to maximize participation, A scheduling framework for large-scale, parallel, and topology-aware applications, Single-processor scheduling with time restrictions, Fuzzy job shop scheduling with lot-sizing, Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan, Construction of balanced sports schedules using partitions into subleagues, Scheduling parallel jobs online with convex and concave parallelizability, Minimizing the number of workers in a paced mixed-model assembly line, Apportionment methods and the Liu-Layland problem, On-line scheduling of parallel jobs on two machines, Score calculation from final tournament tables, High-multiplicity cyclic job shop scheduling, Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan, Better permutations for the single-processor scheduling with time restrictions, Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches, An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables, Scheduling with time-of-use costs, Combination of parallel machine scheduling and vertex cover, A branch and price algorithm for single-machine completion time variance, A hybrid genetic algorithm for the single machine scheduling problem with sequence-dependent setup times, Scheduling on parallel machines with preemption and transportation delays, Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates, A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time, Hybrid variable neighbourhood approaches to university exam timetabling, Minimizing total busy time in parallel scheduling with application to optical networks, Preemptive scheduling with simple linear deterioration on a single machine, Constraint programming approaches to disassembly line balancing problem with sequencing decisions, \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees, Permutation schedules for a two-machine flow shop with storage, Analysis of the similarities and differences of job-based scheduling problems, Two-machine flow shop and open shop scheduling problems with a single maintenance window, Parallel load balancing strategy for volume-of-fluid methods on 3-D unstructured meshes, Solving scheduling and location problems in the plane simultaneously, Idle regulation in non-clairvoyant scheduling of parallel jobs, A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times, Scheduling a maintenance activity and due-window assignment on a single machine, Sequencing mixed-model assembly lines: survey, classification and model critique, Solving an integrated job-shop problem with human resource constraints, The product rate variation problem and its relevance in real world mixed-model assembly lines, Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics, Minimizing costs in round robin tournaments with place constraints, Fair cost-sharing methods for scheduling jobs on parallel machines, Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead, Cut generation for an integrated employee timetabling and production scheduling problem, Decomposition, reformulation, and diving in university course timetabling, An optimal online algorithm for single machine scheduling with bounded delivery times, Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations, Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval, Mathematical programming modeling of the response time variability problem, A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems, Combined task- and network-level scheduling for distributed time-triggered systems, Online scheduling of time-critical tasks to minimize the number of calibrations, Multicriteria movement synchronization scheduling problems and algorithms, Online Optimization of Busy Time on Parallel Machines, Revenue management for operations with urgent orders, Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling, Parallel multiobjective evolutionary algorithms for batch scheduling in heterogeneous computing and grid systems, An Optimal Control Framework for Online Job Scheduling with General Cost Functions, Two-machine flow-shop scheduling to minimize total late work: revisited, Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches, A hyper-heuristic selector algorithm for cloud computing scheduling based on workflow features, Variants of Multi-resource Scheduling Problems with Equal Processing Times, ONLINE CAPACITY PLANNING FOR REHABILITATION TREATMENTS: AN APPROXIMATE DYNAMIC PROGRAMMING APPROACH, Concurrent algorithm for integrating three-dimensional B-spline functions into machines with shared memory such as GPU, Minimizing total weighted late work on a single-machine with non-availability intervals, Scheduling jobs and maintenance activities subject to job-dependent machine deteriorations, Single machine scheduling with non-availability interval and optional job rejection, The longest processing time rule for identical parallel machines revisited, Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost, A comparative study of solution representations for the unrelated machines environment, Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines, Scheduling with competing agents, total late work and job rejection, The efficiency-fairness balance of round robin scheduling, Minimizing makespan on a single machine with release dates and inventory constraints, An iterative exact algorithm for the weighted fair sequences problem, An application of dynamic programming to assign pressing tanks at wineries, Online scheduling of jobs with kind release times and deadlines on a single machine, A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking, Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines, Single-machine scheduling with multi-agents to minimize total weighted late work, An improved greedy algorithm for stochastic online scheduling on unrelated machines, Scheduling uniform machines with restricted assignment, Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine, A graph-based hyper-heuristic for educational timetabling problems, Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines, An improved algorithm for parallel machine scheduling under additional resource constraints, Scheduling jobs on parallel machines to minimize a regular step total cost function, Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling, Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width, A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions, An adversarial model for scheduling with testing, Tight Bounds for Online Vector Scheduling, Model predictive scheduling of semi-cyclic discrete-event systems using switching max-plus linear models and dynamic graphs, Selfish Bin Packing, A Comparison of Random Task Graph Generation Methods for Scheduling Problems, The price of anarchy in an exponential multi-server, Batching-Based Approaches for Optimized Packing of Jobs in the Spatial Scheduling Problem, Product selection, machine time allocation, and scheduling decisions for manufacturing perishable products subject to a deadline, Fair Scheduling via Iterative Quasi-Uniform Sampling, Method of rescheduling for hybrid production lines with intermediate buffers, Online Makespan Scheduling with Job Migration on Uniform Machines, Improved Approximation Algorithm for the Combination of Parallel Machine Scheduling and Vertex Cover, Fixed-Parameter Approximation Schemes for Weighted Flowtime., Greedy multiprocessor server scheduling, Universal Packet Routing with Arbitrary Bandwidths and Transit Times, Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period, Open shop scheduling games, Two competitive agents to minimize the weighted total late work and the total completion time, Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem, Best compromise solution for a new multiobjective scheduling problem, Analysis of computer job control under uncertainty, Unnamed Item, Unnamed Item, Approximation schemes for scheduling and covering on unrelated machines, New resource augmentation analysis of the total stretch of srpt and SJF in multiprocessor scheduling, Weighted network search games with multiple hidden objects and multiple search teams, Exact lexicographic scheduling and approximate rescheduling, Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion, Scheduling to Maximize Participation, Online Parallel-Machine Scheduling in KRT Environment to Minimize Total Weighted Completion Time, Online Scheduling of Incompatible Family Jobs with Equal Length on an Unbounded Parallel-Batch Machine with Job Delivery, Scheduling jobs with release and delivery times subject to nested eligibility constraints, Railway crew scheduling: models, methods and applications, An approximation algorithm for proportionate scheduling in the two-stage hybrid flow shop, Single-machine scheduling with job-dependent machine deterioration, Single-machine online scheduling of jobs with non-delayed processing constraint, Ascents and descents in random trees, Malleable scheduling for flows of jobs and applications to MapReduce, Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs, The single-processor scheduling problem with time restrictions: complexity and related problems, A MULTI-OBJECTIVE RISK-BASED FRAMEWORK FOR MISSION CAPABILITY PLANNING, A review of four decades of time-dependent scheduling: main results, new topics, and open problems, A Survey on Approximation Algorithms for Scheduling with Machine Unavailability, Online scheduling to minimize total weighted (modified) earliness and tardiness cost, Scheduling periodic I/O access with bi-colored chains: models and algorithms, An optimisation approach for pre-runtime scheduling of tasks and communication in an integrated modular avionic system, Online makespan scheduling with job migration on uniform machines, Non-clairvoyantly scheduling to minimize convex functions, A survey of scheduling with parallel batch (p-batch) processing, Scheduling truck drivers with interdependent routes under European Union regulations, Do balanced words have a short period?, Approximated timed reachability graphs for the robust control of discrete event systems, On A Directed Tree Problem Motivated by A Newly Introduced Graph Product, Preemptive and non-preemptive scheduling on two unrelated parallel machines, How small are shifts required in optimal preemptive schedules?, Bi-objective single machine scheduling problem with stochastic processing times, THE PRICE OF MULTI-ORGANIZATION CONSTRAINT IN UNRELATED PARALLEL MACHINE SCHEDULING, An overview of curriculum-based course timetabling, Two-machine flow shop scheduling with a common due date to maximize total early work, Combining constraint programming and temporal decomposition approaches -- scheduling of an industrial formulation plant, The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies, A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions, Shop scheduling in manufacturing environments: a review, Malleable scheduling beyond identical machines, On Ordering Problems: A Statistical Approach, Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity, Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions, An efficient implementation of a VNS heuristic for the weighted fair sequences problem, Preference based scheduling in a healthcare provider network, Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques, Unnamed Item, Timetabling problems at the TU Eindhoven, Online Algorithm for Parallel Job Scheduling and Strip Packing, Approximation algorithms for scheduling with reservations, Similarities between meta-heuristics algorithms and the science of life, Cost-sharing games in real-time scheduling systems, Cost-sharing games in real-time scheduling systems, Achievable Performance of Blind Policies in Heavy Traffic, DYNAMIC CONTROL OF A SINGLE-SERVER SYSTEM WHEN JOBS CHANGE STATUS, Concentration inequalities for nonlinear matroid intersection, Unnamed Item
