Complex Scheduling

DOI10.1007/3-540-29546-1zbMath1154.90002OpenAlexW4249805289MaRDI QIDQ3511304

Sigrid Knust, Peter Brucker

Publication date: 10 July 2008

Published in: GOR ■ Publications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-29546-1

zbMATH Keywords

complexityproject schedulingschedulinglocal searchjob shop schedulinglower boundsconstraint propagationheuristic algorithmsexact algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (33)

The no-wait job shop with regular objective: a method based on optimal job insertion ⋮ On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations ⋮ A flow-based tabu search algorithm for the RCPSP with transfer times ⋮ Robust combinatorial optimization with variable cost uncertainty ⋮ A Posteriori Analysis of the Algorithms for Two-Bar Charts Packing Problem ⋮ Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting ⋮ A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective ⋮ A neighborhood for complex job shop scheduling problems with regular objectives ⋮ Going to the core of hard resource-constrained project scheduling instances ⋮ An analysis of network and resource indicators for resource-constrained project scheduling problem instances ⋮ Improved load balancing and resource utilization for the skill vehicle routing problem ⋮ Linear integer programming model as mathematical ware for an optimal flow production planning system at operational scheduling stage ⋮ Coordinating multi-location production and customer delivery ⋮ Simultaneous scheduling of replacement and repair of common components in operating systems. A multi-objective mathematical optimization model ⋮ A 4/3 OPT+2/3 approximation for big two-bar charts packing problem ⋮ A memetic algorithm for restoring feasibility in scheduling with limited makespan ⋮ Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applications ⋮ Production scheduling with alternative process plans ⋮ A random key based genetic algorithm for the resource constrained project scheduling problem ⋮ Handling precedence constraints in scheduling problems by the sequence pair representation ⋮ IP models for round robin tournaments ⋮ Scheduling linear deteriorating jobs to minimize the number of tardy jobs ⋮ A Lagrangian approach for minimum cost single round robin tournaments ⋮ Personnel scheduling: models and complexity ⋮ The blocking job shop with rail-bound transportation ⋮ A resource constrained scheduling problem with multiple independent producers and a single linking constraint: a coal supply chain example ⋮ On project scheduling problem ⋮ Unbounded parallel batch scheduling with job delivery to minimize makespan ⋮ Project selection, scheduling and resource allocation with time dependent returns ⋮ A branching scheme for finding cost-minimal round robin tournaments ⋮ Metric approach for finding approximate solutions of scheduling problems ⋮ Approximability results for the resource-constrained project scheduling problem with a single type of resources ⋮ Scheduling interfering job sets on parallel machines

This page was built for publication: Complex Scheduling