zbMath0767.90033MaRDI QIDQ4023677
Jan Weglarz, Jacek Błażewicz, Günter Schmidt, Klaus H. Ecker
Publication date: 23 January 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deterministic and stochastic scheduling with teamwork tasks,
Scheduling chains to minimize mean flow time,
Vehicle scheduling in two-cycle flexible manufacturing systems,
Scheduling complete intrees on two uniform processors with communication delays,
Real-time scheduling of linear speedup parallel tasks,
A note on scheduling on a single processor with speed dependent on a number of executed jobs,
Parallel machine scheduling with machine availability and eligibility constraints,
Bicriteria scheduling for due date assignment with total weighted tardiness,
A variant of the permutation flow shop model with variable processing times,
Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints,
On the complexity of two machine job-shop scheduling with regular objective functions,
Lot-size scheduling of two types of jobs on identical machines,
Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption,
FUN: a dynamic method for scheduling problems,
Two-agent single-machine scheduling with release dates to minimize the makespan,
Improving delivery reliability by a new due-date setting rule,
Resource-constrained project scheduling: A survey of recent developments.,
A new approximation algorithm for UET-scheduling with chain-type precedence constraints.,
Scheduling on uniform machines with a conflict graph: complexity and resolution,
Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption,
Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints.,
An integrated dispatching model for rail yards operations.,
Random trees in queueing systems with deadlines,
Scheduling jobs with varying processing times,
Scheduling \(UET\)-tasks on a star network: complexity and approximation,
Optimal preemptive scheduling on a fixed number of identical parallel machines,
Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results,
Sensitivity analysis of scheduling algorithms,
Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness,
Preface: Project management and scheduling,
Preemptive scheduling and antichain polyhedra,
Match-up scheduling under a machine breakdown,
Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems,
Two branch and bound algorithms for the permutation flow shop problem,
Extensions of coloring models for scheduling purposes,
Inequality-sum: a global constraint capturing the objective function,
Scheduling multiprocessor tasks -- An overview,
Scheduling multiprocessor tasks with chain constraints,
Minimizing the overhead for some tree-scheduling problems,
Minimizing the schedule length for a parallel 3D-grid precedence graph,
A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem,
Combinatorial optimization models for production scheduling in automated manufacturing systems,
Scheduling Precedence Task Graphs with Disturbances,
Scheduling in synchronous networks and the greedy algorithm,
Dynamic scheduling of parallel computations,
A framework for the description of evolutionary algorithms,
A review of TSP based approaches for flowshop scheduling,
A survey of the state-of-the-art of common due date assignment and scheduling research
