scientific article; zbMATH DE number 2114378

Publication date: 10 November 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

computational complexity linear programming heuristics scheduling dynamic programming branch-and-bound polynomial algorithms

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (63)

Scheduling on parallel machines considering job-machine dependency constraints ⋮ Online scheduling of time-critical tasks to minimize the number of calibrations ⋮ Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs ⋮ Job shop scheduling with unit length tasks ⋮ Job-shop scheduling with limited capacity buffers ⋮ An improved typology of cutting and packing problems ⋮ Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics ⋮ Scheduling jobs and maintenance activities subject to job-dependent machine deteriorations ⋮ Depth-first heuristic search for the job shop scheduling problem ⋮ Decentralized task coordination ⋮ Tabu search algorithms for cyclic machine scheduling problems ⋮ Hierarchical optimization on an unbounded parallel-batching machine ⋮ The quality of equilibria for set packing and throughput scheduling games ⋮ A truthful mechanism for value-based scheduling in cloud computing ⋮ The expected asymptotical ratio for preemptive stochastic online problem ⋮ Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time ⋮ A note on reverse scheduling with maximum lateness objective ⋮ An iterative exact algorithm for the weighted fair sequences problem ⋮ Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems ⋮ Scheduling UET-UCT tasks: Branch-and-bound search in the priority space ⋮ Collective schedules: axioms and algorithms ⋮ Machine scheduling with job rejection and Dejong's learning effect ⋮ Matching based very large-scale neighborhoods for parallel machine scheduling ⋮ Batch Coloring Flat Graphs and Thin ⋮ Scheduling for electricity cost in a smart grid ⋮ A fuzzy random resource-constrained scheduling model with~multiple projects and its application to a working procedure in a large-scale water conservancy and hydropower construction project ⋮ Scheduling flexible maintenance activities subject to job-dependent machine deterioration ⋮ Reliability of task graph schedules with transient and fail-stop failures: complexity and algorithms ⋮ Preemptive scheduling of two uniform parallel machines to minimize total tardiness ⋮ Inverse scheduling: Two-machine flow-shop problem ⋮ Max-coloring paths: tight bounds and extensions ⋮ Optimal rules for single machine scheduling with stochastic breakdowns ⋮ Approximation schemes for packing with item fragmentation ⋮ A polynomial-time algorithm for a flow-shop batching problem with equal-length operations ⋮ Scheduling results applicable to decision-theoretic troubleshooting ⋮ Preemptive scheduling on uniform parallel machines with controllable job processing times ⋮ Online square packing with gravity ⋮ Exponential neighborhood search for a parallel machine scheduling problem ⋮ On scheduling with the non-idling constraint ⋮ Cyclic job shop scheduling problems with blocking ⋮ Column generation heuristics for multiple machine, multiple orders per job scheduling problems ⋮ Scheduling coordination problems in supply chain planning ⋮ Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times ⋮ Scheduling problem with multi-purpose parallel machines ⋮ Unrelated parallel-machine scheduling problems with aging effects and deteriorating maintenance activities ⋮ Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups ⋮ Scheduling at coal handling facilities using simulated annealing ⋮ Heuristics for a flowshop scheduling problem with stepwise job objective function ⋮ Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times ⋮ Towards a reference model for timetabling and rostering ⋮ An exact approach for scheduling jobs with regular step cost functions on a single machine ⋮ A new heuristic for open shop total completion time problem ⋮ On scheduling with the non-idling constraint ⋮ A cyclic approach to large-scale short-term planning in chemical batch production ⋮ Optimal online-list batch scheduling ⋮ Throughput-optimal sequences for cyclically operated plants ⋮ Counting and enumeration complexity with application to multicriteria scheduling ⋮ Weighted sum coloring in batch scheduling of conflicting jobs ⋮ Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations ⋮ Inverse scheduling with maximum lateness objective ⋮ A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times ⋮ Green scheduling, flows and matchings ⋮ Adjacent-Resource Scheduling

This page was built for publication: