scientific article; zbMATH DE number 1634827
zbMATH Open1051.90011MaRDI QIDQ2734595FDOQ2734595
Authors: Peter Brucker
Publication date: 20 August 2001
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 830382
- Scheduling algorithms
- scientific article; zbMATH DE number 2114378
- scientific article; zbMATH DE number 1167865
- Scheduling. Theory, algorithms, and systems
- Scheduling. Theory, algorithms, and systems
- scientific article; zbMATH DE number 2099400
- scientific article; zbMATH DE number 16428
- Scheduling algorithms for procrastinators
- On synthesis of scheduling algorithms
Linear programming (90C05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Abstract computational complexity for mathematical programming problems (90C60) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Cited In (only showing first 100 items - show all)
- The one machine scheduling problem: insertion of a job under the real-time constraint
- Online scheduling of two job types on a set of multipurpose machines with unit processing times
- A memetic algorithm for the job-shop with time-lags
- Single machine scheduling with common due date and controllable processing times
- Scheduling the production of rolling ingots: industrial context, model, and solution method
- Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
- Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
- Single machine parallel batch scheduling subject to precedence constraints
- Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria
- The minmax regret permutation flow-shop problem with two jobs
- Title not available (Why is that?)
- On the open-shop problem with preemption and minimizing the average completion time
- Reduction method for concept lattices based on rough set theory and its application
- Computational complexity of some scheduling problems with multiprocessor tasks
- Title not available (Why is that?)
- Scheduling resource allocation with timeslot penalty for changeover
- Handbook on Scheduling
- Title not available (Why is that?)
- Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness
- Single-machine Scheduling Problems with Aging/Deteriorating Effect under an Optional Maintenance Activity Consideration
- Two-agent scheduling of time-dependent jobs
- Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan
- Unrelated parallel-machine scheduling with deterioration effects and deteriorating multi-maintenance activities for minimizing the total completion time
- Scheduling policies using marked/phantom slot algorithms
- On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times.
- Scheduling of coupled tasks with unit processing times
- The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
- Complexity of two dual criteria scheduling problems
- Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times
- Single machine unbounded parallel-batch scheduling with forbidden intervals
- A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures
- How useful are preemptive schedules?
- A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network
- The museum visitor routing problem
- A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times
- Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan
- Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost
- Metrics in scheduling problems
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
- Necessary and sufficient conditions of optimality for some classical scheduling problems
- On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan
- Scheduling algorithms
- Scheduling and constraint propagation
- A DP algorithm for minimizing makespan and total completion time on a series-batching machine
- Title not available (Why is that?)
- An iterative algorithm for scheduling UET tasks with due dates and release times.
- Single-machine past-sequence-dependent setup times scheduling with resource allocation and learning effect
- Title not available (Why is that?)
- Finding total unimodularity in optimization problems solved by linear programs
- Due-window assignment and scheduling with multiple rate-modifying activities under the effects of deterioration and learning
- Lower bound algorithms for multiprocessor task scheduling with ready times
- Multi-agent scheduling on a single machine with max-form criteria
- Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption
- Scheduling a single machine to minimize a regular objective function under setup constraints
- Note on ``Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time
- Scheduling with job-dependent learning effects and multiple rate-modifying activities
- The routing open-shop problem on a network: complexity and approximation
- Scheduling unit length jobs on parallel machines with lookahead information
- Single-machine scheduling with precedence constraints and position-dependent processing times
- Complexity of minimizing the total flow time with interval data and minmax regret criterion
- Basic scheduling problems with raw material constraints
- Pre-emptive scheduling problems with controllable processing times
- Efficient algorithms for periodic scheduling
- Stackelberg scheduling strategies
- Approximability of single machine scheduling with fixed jobs to minimize total completion time
- Extensions of Decision-Theoretic Troubleshooting: Cost Clusters and Precedence Constraints
- Multipurpose machine scheduling with rejection and identical job processing times
- Preemptive scheduling with simple linear deterioration on a single machine
- Comments on ``Design and performance evaluation of load distribution strategies for multiple loads on heterogeneous linear daisy chain networks
- Algorithms for solving minimax scheduling problem
- Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm
- Non-clairvoyant scheduling games
- Production and transport logistics scheduling with two transport mode choices
- The inverse parallel machine scheduling problem with minimum total completion time
- Single machine scheduling with decreasing linear deterioration under precedence constraints
- Two-directional traffic scheduling problem solution for a single-track railway with siding
- Logistics scheduling with batching and transportation
- Single-machine scheduling and slack due-date assignment with aging effect and deteriorating maintenance
- Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness
- Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time
- A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations
- Reliability aware scheduling of bag of real time tasks in cloud environment
- Model predictive scheduling of semi-cyclic discrete-event systems using switching max-plus linear models and dynamic graphs
- Permutation-induced acyclic networks for the job shop scheduling problem
- Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors
- Scheduling lower bounds via AND subset sum
- Scheduling the two-way traffic on a single-track railway with a siding
- Due date assignment single-machine scheduling with delivery times, position-dependent weights and deteriorating jobs
- 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 Bicriterion Approach to Due Date Assignment Scheduling in Single-Machine with Position-Dependent Weights
- Single machine batch scheduling problem with family setup times and release dates to minimize makespan
- Graph models for scheduling systems with machine saturation property
- A Production Plan Considering Parallel Machines and Deteriorating Effects: Minimizing the Makespan in the Section of Steel Box Girder Processing
- A note on special optimal batching structures to minimize total weighted completion time
- An effective heuristic algorithm for the partial shop scheduling problem
- Bounded serial-batching scheduling for minimizing maximum lateness and makespan
- Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity
- Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights
- Single-machine multitasking scheduling with job efficiency promotion
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2734595)