scientific article
From MaRDI portal
Publication:2734595
zbMath1051.90011MaRDI QIDQ2734595
Publication date: 20 August 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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) Combinatorial optimization (90C27) Dynamic programming (90C39) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (only showing first 100 items - show all)
Scheduling lower bounds via AND subset sum ⋮ Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors ⋮ A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times ⋮ Production and transport logistics scheduling with two transport mode choices ⋮ Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness ⋮ Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan ⋮ Reduction method for concept lattices based on rough set theory and its application ⋮ Permutation-induced acyclic networks for the job shop scheduling problem ⋮ Necessary and sufficient conditions of optimality for some classical scheduling problems ⋮ Scheduling the production of rolling ingots: industrial context, model, and solution method ⋮ Scheduling the two-way traffic on a single-track railway with a siding ⋮ Bicriteria scheduling for due date assignment with total weighted tardiness ⋮ Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness ⋮ Complexity of two dual criteria scheduling problems ⋮ Approximability of single machine scheduling with fixed jobs to minimize total completion time ⋮ An effective heuristic algorithm for the partial shop scheduling problem ⋮ Scheduling resource allocation with timeslot penalty for changeover ⋮ Single-machine scheduling with precedence constraints and position-dependent processing times ⋮ The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan ⋮ Single-machine multitasking scheduling with job efficiency promotion ⋮ Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity ⋮ Scheduling of coupled tasks with unit processing times ⋮ Pre-emptive scheduling problems with controllable processing times ⋮ Single machine batch scheduling problem with family setup times and release dates to minimize makespan ⋮ The inverse parallel machine scheduling problem with minimum total completion time ⋮ Two-agent scheduling of time-dependent jobs ⋮ Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption ⋮ Graph models for scheduling systems with machine saturation property ⋮ Single-machine scheduling and slack due-date assignment with aging effect and deteriorating maintenance ⋮ Metrics in scheduling problems ⋮ Single-machine past-sequence-dependent setup times scheduling with resource allocation and learning effect ⋮ An iterative algorithm for scheduling UET tasks with due dates and release times. ⋮ Single machine unbounded parallel-batch scheduling with forbidden intervals ⋮ A note on special optimal batching structures to minimize total weighted completion time ⋮ Finding total unimodularity in optimization problems solved by linear programs ⋮ Minimizing total completion time for preemptive scheduling with release dates and deadline constraints ⋮ Note on ``Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time ⋮ The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times ⋮ Application of an optimization problem in max-plus algebra to scheduling problems ⋮ Complexity of minimizing the total flow time with interval data and minmax regret criterion ⋮ Comments on ``Design and performance evaluation of load distribution strategies for multiple loads on heterogeneous linear daisy chain networks ⋮ A note on scheduling multiprocessor tasks with identical processing times. ⋮ How useful are preemptive schedules? ⋮ On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times. ⋮ Non-clairvoyant scheduling games ⋮ Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost ⋮ Reliability aware scheduling of bag of real time tasks in cloud environment ⋮ Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time ⋮ Single-machine common flow allowance scheduling with job-dependent aging effects and a deteriorating maintenance activity ⋮ Model predictive scheduling of semi-cyclic discrete-event systems using switching max-plus linear models and dynamic graphs ⋮ Scheduling with job-dependent learning effects and multiple rate-modifying activities ⋮ Scheduling unit length jobs on parallel machines with lookahead information ⋮ Improved algorithms for two-agent scheduling on an unbounded serial-batching machine ⋮ A memetic algorithm for the job-shop with time-lags ⋮ Extensions of Decision-Theoretic Troubleshooting: Cost Clusters and Precedence Constraints ⋮ Multi-agent scheduling on a single machine with max-form criteria ⋮ Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint ⋮ Two-directional traffic scheduling problem solution for a single-track railway with siding ⋮ Bounded serial-batching scheduling for minimizing maximum lateness and makespan ⋮ Single machine parallel batch scheduling subject to precedence constraints ⋮ A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures ⋮ A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations ⋮ Logistics scheduling with batching and transportation ⋮ On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan ⋮ Online scheduling of two job types on a set of multipurpose machines with unit processing times ⋮ Scheduling and constraint propagation ⋮ Due-window assignment and scheduling with multiple rate-modifying activities under the effects of deterioration and learning ⋮ Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan ⋮ The museum visitor routing problem ⋮ Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria ⋮ Single machine scheduling with common due date and controllable processing times ⋮ On the open-shop problem with preemption and minimizing the average completion time ⋮ Some algorithms of solving minimax multiprocessor scheduling problem ⋮ Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times ⋮ Preemptive scheduling with simple linear deterioration on a single machine ⋮ Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm ⋮ The worst-case analysis of the Garey-Johnson algorithm ⋮ Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan ⋮ Single machine scheduling with decreasing linear deterioration under precedence constraints ⋮ The routing open-shop problem on a network: complexity and approximation ⋮ Multipurpose machine scheduling with rejection and identical job processing times ⋮ A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network ⋮ Scheduling a single machine to minimize a regular objective function under setup constraints ⋮ A DP algorithm for minimizing makespan and total completion time on a series-batching machine ⋮ Research on single-machine scheduling with position-dependent weights and past-sequence-dependent delivery times ⋮ Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work ⋮ A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks ⋮ Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan ⋮ Unrelated parallel-machine scheduling with deterioration effects and deteriorating multi-maintenance activities for minimizing the total completion time ⋮ Basic scheduling problems with raw material constraints ⋮ Algorithms for solving minimax scheduling problem ⋮ Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights ⋮ A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system ⋮ Online Non-preemptive Scheduling to Optimize Max Stretch on a Single Machine ⋮ Computational complexity of some scheduling problems with multiprocessor tasks ⋮ Lower bound algorithms for multiprocessor task scheduling with ready times ⋮ The one machine scheduling problem: insertion of a job under the real-time constraint ⋮ On lower and upper bounds for single machine parallel batch scheduling ⋮ The minmax regret permutation flow-shop problem with two jobs ⋮ Single-machine scheduling problems with precedence constraints and simple linear deterioration
This page was built for publication:
