Handbook on Scheduling

From MaRDI portal
Publication:5754725

DOI10.1007/978-3-540-32220-7zbMath1165.90009OpenAlexW4233104832MaRDI QIDQ5754725

Erwin Pesch, Jacek Błażewicz, Jan Weglarz, Günter Schmidt, Klaus H. Ecker

Publication date: 20 August 2007

Published in: International Handbook on Information Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-32220-7




Related Items (64)

Scheduling shared continuous resources on many-coresScheduling under a non-reversible energy source: an application of piecewise linear bounding of non-linear demand/cost functionsA parallel machine schedule updating game with compensations and clients averse to uncertain lossNovel dual discounting functions for the Internet shopping optimization problem: new algorithmsScheduling for data gathering networks with data compressionHeuristic algorithms for the minmax regret flow-shop problem with interval processing timesEnergy-efficient scheduling in manufacturing companies: a review and research frameworkA survey on single crane scheduling in automated storage/retrieval systemsScheduling preemptable jobs on identical processors under varying availability of an additional continuous resourceEnergy-oriented scheduling based on evolutionary algorithmsIterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterionVariable neighbourhood search and tabu search for a discrete time/cost trade-off problem to minimize the maximal cash flow gapReconstructing binary matrices with timetabling constraintsAn exact extended formulation for the unrelated parallel machine total weighted completion time problemControllable processing times in project and production management: analysing the trade-off between processing times and the amount of resourcesPolynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early workFlexible flow shop with dedicated buffersA polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraintGuest editorial: ``New trends in scheduling Centre CNRS ``La Villa Clythia Frejus workshop 2010Variable neighborhood search for the single machine scheduling problem to minimize the total early workBranch‐and‐bound approach for optima localization in scheduling multiprocessor jobsNew perspectives in scheduling theoryProject scheduling with finite or infinite number of activity processing modes -- a surveyAbsolute bounds of list algorithms for parallel machines scheduling with unavailability periodsIntegrated truck and workforce scheduling to accelerate the unloading of trucksA generalized classification scheme for crane scheduling with interferenceAn improved approximation algorithm for a scheduling problem with transporter coordinationApproximation algorithms for inventory constrained scheduling on a single machineModelling and solving grid resource allocation problem with network resources for workflow applicationsA worker constrained flexible job shop scheduling problem with sequence-dependent setup timesScheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequenceA variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterionA Family of Scheduling Algorithms for Hybrid Parallel PlatformsA study of scheduling problems with preemptions on multi-core computers with GPU acceleratorsScheduling aspects in keyword extraction problemA branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operationsSequencing of picking orders in mobile rack warehousesFPTAS for the two identical parallel machine problem with a single operator under the free changing modeModels and matheuristics for the unrelated parallel machine scheduling problem with additional resourcesBetter permutations for the single-processor scheduling with time restrictionsAlgorithms for communication scheduling in data gathering network with data compressionMetaheuristics for multi-mode capital-constrained project payment schedulingSolving a power-aware scheduling problem by grouping jobs with the same processing characteristicNew challenges in scheduling theoryApproximability of total weighted completion time with resource consuming jobsA survey of variants and extensions of the resource-constrained project scheduling problemAnalysis of the similarities and differences of job-based scheduling problemsCommunication scheduling in data gathering networks of heterogeneous sensors with data compression: algorithms and empirical experimentsParameterized complexity of a coupled-task scheduling problemPHEFT: pessimistic image processing workflow scheduling for DSP clustersSolving scheduling and location problems in the plane simultaneouslySimulated annealing for financing cost distribution based project payment scheduling from a joint perspectiveDiscrete-continuous project scheduling with discounted cash inflows and various payment models -- a review of recent resultsPreemptive parallel-machine scheduling problem of maximizing the number of on-time jobsThe single-processor scheduling problem with time restrictions: complexity and related problemsA review of four decades of time-dependent scheduling: main results, new topics, and open problemsComputing the execution probability of jobs with replication in mixed-criticality schedulesSingle-machine batch scheduling to minimize the total setup cost in the presence of deadlinesParallel execution of schedules with random dependency graphEquivalent time-dependent scheduling problemsA classification scheme for integrated staff rostering and scheduling problemsUnnamed ItemResource-Constrained Scheduling with Non-constant Capacity and Non-regular ActivitiesParallel machine scheduling with additional resources: notation, classification, models and solution methods




This page was built for publication: Handbook on Scheduling