scientific article; zbMATH DE number 2146482
From MaRDI portal
zbMath1058.90500MaRDI QIDQ4658190
Louis W. Miller, William L. Maxwell, Richard Conway
Publication date: 16 March 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deterministic network models in operations research (90B10) 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
Batch-scheduling problems to minimize actual flow times of parts through the shop under JIT environment, Integration of lotsizing and scheduling decisions in a job-shop, Nonclairvoyant scheduling, Incorporating preference information into multi-objective scheduling, The stochastic single machine scheduling problem with earliness and tardiness costs, An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal, A scheduling problem in a semi-open job shop -- the case of a cordset manufacturing company, Earliness-tardiness scheduling problems with a common delivery window, One-machine generalized precedence constrained scheduling problems, Evolution based learning in a job shop scheduling environment, Effective job shop scheduling through active chain manipulation, Flowshop scheduling with dominant machines, Dynamic non-preemptive single machine scheduling, Heuristic algorithms for the two-stage hybrid flowshop problem, Single facility scheduling with major and minor setups, A fast finite loading algorithm for job oriented scheduling, On the existence of schedules that are near-optimal for both makespan and total weighted completion time, The complexity of scheduling job families about a common due date, The scheduling problem where multiple machines compete for a common local buffer, Queue structure control in a single-server system with variable service rate, Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem, Multiple and bicriteria scheduling: A literature survey, Solving a bicriterion scheduling problem, Generalized pairwise interchanges and machine scheduling, Job-shop scheduling: Computational study of local search and large-step optimization methods, Characterizing the set of feasible sequences for n jobs to be carried out on a single machine, Is a unit-job shop not easier than identical parallel machines?, An efficient job scheduling algorithm for mixed turnaround and deadline applications, An adaptive branching rule for the permutation flow-shop problem, Sequencing with general precedence constraints, Complexity results for scheduling chains on a single machine, Subtractive clustering based modeling of job sequencing with parametric search, Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity, Polling systems with breakdowns and repairs., Delay performance in stochastic processing networks with priority service., Weak-order extensions of an order., Resource-constrained project scheduling: A survey of recent developments., RTSS: An interactive decision support system for solving real time scheduling problems considering customer and job priorities with schedule interruptions., Discrete extremal problems, On reducing time spent in M/G/1 systems, Hybrid algorithm for sequencing with bicriteria, Scheduling of plant maintenance personnel, An algorithm for single machine sequencing with release dates to minimize total weighted completion time, Surrogate duality relaxation for job shop scheduling, A multi-objective approach to resource allocation in single machine scheduling, Flow time distributions in a \(K\) class \(M/G/1\) priority feedback queue, On the complexity of generalized due date scheduling problems, The complexity of shop-scheduling problems with two or three jobs, Optimal assignment of slack due-dates and sequencing of jobs with random processing times on a single machine, Stability of an optimal schedule, Job lateness in a two-machine flowshop with setup times separated, On optimal lateness and tardiness scheduling in real-time systems, An efficient heuristic approach to the scheduling of jobs in a flowshop, Efficient heuristics to minimize total flow time with release dates, Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem, Multi-item batching heuristics for minimization of queueing delays, Resource constrained project scheduling with multiple objectives: a decision support approach, Design of manufacturing systems using queueing models, Scheduling stochastic jobs with increasing hazard rate on identical parallel machines, Capacitated two-parallel machines scheduling to minimize sum of job completion times, On batch scheduling of jobs with stochastic service times and cost structures on a single server, Scheduling according to job priority with prevention of deadlock and permanent blocking, Optimal scheduling of homogeneous job systems, Multiple feedback at a single-server station, Scheduling with list processing and problem oriented data structures. An itinerant teacher example, Some notes on the queueing analysis of the SCAN policy of the walking server, M/G/1 round robin discipline, A tool-change scheduling model for machining centres, Star search -- a different show, Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem, The two-machine total completion time flow shop problem, Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation, A strategy for evolution of algorithms to increase the computational effectiveness of NP-hard scheduling problems, Integration of operation routing and economic production quantity decisions in batch manufacturing systems, The job shop scheduling problem: Conventional and new solution techniques, Variants of the two machine flow shop problem connected with factorization of matrix functions, Single machine scheduling with batch deliveries, Scheduling with batch setup times and earliness-tardiness penalties, Evaluation of leading heuristics for the single machine tardiness problem, A framework for decision support systems of scheduling problems, Parallel machine scheduling with a common server, An evaluation of due date, resource allocation, project release, and activity scheduling rules in a multiproject environment, The complexity of multidimensional periodic scheduling, Scheduling parallel tasks with individual deadlines, Minimizing makespan subject to minimum total flow-time on identical parallel machines, Class dependent departure process from multiclass phase queues: Exact and approximate analyses, Two-machine shop scheduling with zero and unit processing times, Lead time selection and the behaviour of work flow in job shops, Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem, Lot streaming in open shops, Deterministic job-shop scheduling problems with capacity focus, Due date assignment procedures with dynamically updated coefficients for multilevel assembly job shops, Parallel machine scheduling to minimize costs for earliness and number of tardy jobs, Scheduling two jobs with fixed and nonfixed routes, Scheduling identical parallel machines to minimize total weighted completion time, Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling, A greedy heuristic for the mean tardiness sequencing problem, Nonpreemptive flowshop scheduling with machine dominance, Analytical loading models in flexible manufacturing systems, Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment, Controlled jump process models for stochastic scheduling problems, The lower-class waiting time distribution in the delayed accumulating priority queue, A genetic algorithm for the flowshop scheduling problem, AN INFINITE-PHASE QUASI-BIRTH-AND-DEATH MODEL FOR THE NON-PREEMPTIVE PRIORITYM/PH/1 QUEUE, Unnamed Item, Multicriteria scheduling using fuzzy theory and tabu search, An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops, Optimal scheduling of jobs about a common due date on a single machine, Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date, An experimental analysis of the CGPS algorithm for the three-machine flow shop scheduling with minimum makespan criterion, Minimizing flowtime and missed due-dates in single-machine sequencing, On complexity of optimal recombination for flowshop scheduling problems, A local search using solution fragments for the 2-machine bicriteria scheduling problem, Unnamed Item, Complexity of optimal scheduling problems with three jobs, Optimal distribution of technological operations on an assembly line, Two- and three-machine flow shop scheduling problems with equal sized transfer batches, Social welfare and price of anarchy in preemptive priority queues, Stochastic scheduling problems I — General strategies, Route selection and flow control in a multi-stage manufacturing system with heterogeneous machines within stages, Some problems in discrete optimization, Dynamical Neural Network Approach to the Job-shop Scheduling, Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines, Task scheduling with precedence constraints to minimize the total completion time, General flow-shop scheduling with resource constraints, Heavy-Traffic Analysis of Sojourn Time Under the Foreground–Background Scheduling Policy, Analysis and Experimental Study of Heuristics for Job Scheduling Reoptimization Problems, Determination of an optimal common due date and optimal sequence in a single machine job shop, Recent sojourn time results for multilevel processor‐sharing scheduling disciplines, Unnamed Item, Heuristische Verfahren zur Maschinenbelegungsplanung bei Reihenfertigung, Integration of priority dispatching and due-date assignment in a job shop, An algorithm to minimize total flowtime and maximum job lateness in the two-machine flowshop system, Unnamed Item, A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan, Modeling and analysis of multiobjective lot splitting for N -product M -machine flowshop lines, Minimizing total completion time in a two-machine flowshop: Analysis of special cases, Minimizing maximum lateness on one machine: computational experience and some applications, Stochastic scheduling with order constraints, The filtered counting process and its applications to stochastic manufacturing systems, A study of simple rules for subcontracting in make-to-order manufacturing, Two-phase method for designing flexible manufacturing systems, Dispatching rules in scheduling Dispatching rules in scheduling: a fuzzy approach, A dynamic job shop scheduling framework: a backward approach, Evaluating variance control, order review/release and dispatching: a regression analysis, Impact of sequence-dependent setup time on job shop scheduling performance, Managing a two-bottleneck job shop with a two-machine flow shop algorithm, Impact of family-based scheduling on transfer batches in a job shop manufacturing cell, An algorithm for the solution of the two-route Johnson problem, A note on the departure process in an (S− 1, S) inventory system, An experimental investigation of scheduling non-identical, parallel processors with sequence-dependent set-up times and due dates, Design and scheduling of flexible assembly lines for printed circuit boards, An integrated system for controlling shop loading and work flow, Comparison of dispatch policies for a single server queueing model with limited operational control, Production scheduling of independent jobs on parallel identical processors, Minimizing flowtime subject to optimal makespan on two identical parallel machines, Minimizing the earliness--tardiness costs on a single machine, Robust scheduling in an advanced planning and scheduling environment, Scheduling job shops with delays, A comparison of exhaustive and non-exhaustive group scheduling heuristics in a manufacturing cell, Flowshop/no-idle scheduling to minimise the mean flowtime, A note on single-machine makespan scheduling with deteriorating jobs and scheduled maintenance, Decentralized utilitarian mechanisms for scheduling games, Scheduling a maintenance activity on parallel identical machines, Analysis of automated guided vehicle configurations in flexible manufacturing systems, Achievable Performance of Blind Policies in Heavy Traffic, Effectiveness of an algorithm for the construction of a scheduling, Effective solution of certain problems of theory of schedulings of nets, Single-machine group scheduling problems with deteriorating and learning effect, Event-Time Models for Supply Chain Scheduling, Minimizing total flowtime and maximum job lateness in the twomachine flowshop system: a computerized algorithm, A new continuous model for job-shop scheduling, Scheduling, simulation, and optimization, A mixed integer programming model for scheduling orders in a steel mill, Using precedence intervals to solve constrained precedence problems, Analysis of preemptive loss priority queues with preemption distance, Bin packing using semi-ordinal data, Low-complexity algorithms for sequencing jobs with a fixed number of job-classes, Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs, One ordering problem, Scheduling problems with random processing times under expected earliness/tardiness costs, A hybrid method for solving stochastic job shop scheduling problems, The Israeli Queue with Priorities, Flowshop scheduling research after five decades, A new sufficient condition of optimality for the two-machine flowshop problem, Applying machine based decomposition in 2-machine flow shops, A review of TSP based approaches for flowshop scheduling, Synthesis of single-product networks, Finding shuffle words that represent optimal scheduling of shared memory access, Scheduling with target times, The effect of combining simple priority heuristics in flow-dominant shops, Dynamic assignation of due-dates in an assembly shop based in simulation, A new method for workshop real time scheduling, Scheduling larger job shops: a decomposition approach, Scheduling research in multiple resource constrained job shops: a review and critique, Information and scheduling in a dual resource constrained job shop, Analysis of the Q.A.D. algorithm for an homogeneous multiprocessor computing model with independent memories, Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System, Analytical determination of optimal TWK due-dates in a job shop, Controlling Overload in a Digital System, Minimizing the weighted number of tardy jobs on multiple machines: a review, The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm, Scheduling with monotonous earliness and tardiness penalties, A tabu search experience in production scheduling, A tabu-search heuristic for the flexible-resource flow shop scheduling problem, Makespan minimization subject to flowtime optimality on identical parallel machines, \((N, n)\)-preemptive-priority M/G/1 queues with finite and infinite buffers, NP-hardness of shop-scheduling problems with three jobs, Processing-plus-wait due dates in single-machine scheduling, Particle swarm optimization combined with genetic operators for job shop scheduling problem with fuzzy processing time, Single machine group scheduling with ordered criteria, Dominance-based heuristics for one-machine total cost scheduling problems, Performance of static priority rules for shared facilities in a remanufacturing shop with disassembly and reassembly, Definition and properties of the input-weighted average lead-time, On games corresponding to sequencing situations with ready times, Asymptotic optimality of statistical multiplexing in pipelined processing, An examination of job interchange relationships and induction-based proofs in single machine scheduling, Approximation and online algorithms for multidimensional bin packing: a survey, Parallel-machine scheduling of jobs with mixed job-, machine- and position-dependent processing times, On a scheduling problem in a robotized analytical system, Chance-constrained model for uncertain job shop scheduling problem, Ordinal algorithms for parallel machine scheduling, Optimal sequences in stochastic single machine shops, Applications of max-plus algebra to flow shop scheduling problems, An NC algorithm for finding a minimum weighted completion time schedule on series parallel graphs, Simple matching vs linear assignment in scheduling models with positional effects: a critical review, Identical parallel machine scheduling with assurance of maximum waiting time for an emergency job, The price of anarchy for utilitarian scheduling games on related machines, Integer preemptive scheduling on parallel machines, Alternating priority versus FCFS scheduling in a two-class queueing system, A batch-oblivious approach for complex job-shop scheduling problems, Improving delivery reliability by a new due-date setting rule, Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine, Algorithms for single machine total tardiness scheduling with sequence dependent setups, Single-machine scheduling with no idle time and release dates to~minimize a regular criterion, Vyacheslav Tanaev: contributions to scheduling and related areas, Maximum cost scheduling of jobs with mixed variable processing times and \(k\)-partite precedence constraints, Two schemes of the branch-and-bound method for a flow shop total weighted tardiness minimization problem, Scheduling the production of two-component jobs on a single machine, Fuzzy programming for multiobjective job shop scheduling with fuzzy processing time and fuzzy duedate through genetic algorithms, Integrated optimization of process planning and scheduling for reducing carbon emissions, Tabu search for multi-mode resource-constrained project scheduling with schedule-dependent setup times, On the optimality conditions of the two-machine flow shop problem, Scheduling a two-stage flowshop under makespan constraint, Multi-agent single machine scheduling, \(T\)-preemptive priority queue and its application to the analysis of an opportunistic spectrum access in cognitive radio networks, Optimizing schedules in the pipeline systems with variable job execution order, On the average sojourn time under \(M/M/1/\)SRPT, Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models, Robust algorithms for total completion time, Analysis of computer job control under uncertainty, Aggregation in job scheduling in machine works, Decomposition approaches in permutation scheduling problems with application to the M-machine flow shop scheduling problems, Parallel machine scheduling with a convex resource consumption function, A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem, A comprehensive review and evaluation of permutation flowshop heuristics, An algorithm for insertion of idle time in the single-machine scheduling problem with convex cost functions, Group scheduling with controllable setup and processing times: minimizing total weighted completion time, Jitter minimization in scheduling computations in real-time systems, Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics, An algorithm for scheduling exchanges over a bus with centralized control and an analysis of its efficiency, Fast heuristics for minimizing the makespan in non-permutation flow shops, A new heuristic for the n-job, M-machine flow-shop problem, A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems, Preemptible queues with advance reservations: strategic behavior and revenue management, PHEFT: pessimistic image processing workflow scheduling for DSP clusters, On index policies for stochastic minsum scheduling, Shop scheduling problems with pliable jobs, Some concepts of stability analysis in combinatorial optimization, On the minimization of total weighted flow time with identical and uniform parallel machines, Deterministic job-shop scheduling: Past, present and future, Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs, On the balancedness of multiple machine sequencing games, Analysis of the twisting department at superior cable corporation: A case study, Preemptive scheduling on identical parallel machines subject to deadlines., The three-machine proportionate flow shop problem with unequal machine speeds, A class of on-line scheduling algorithms to minimize total completion time, The evolution of schematic representations of flow shop scheduling problems, A review of four decades of time-dependent scheduling: main results, new topics, and open problems, Scheduling chain-structured tasks to minimize makespan and mean flow time, Two-sided bounds on the mean number of system failures during busy periods for various queueing disciplines, Improved price of anarchy for machine scheduling games with coordination mechanisms, Single machine scheduling to minimize mean absolute lateness: A heuristic solution, A finite capacity multi-queueing system with priorities and with repeated server vacations, Response times in gated M/G/1 queues: The processor-sharing case, An optimal online algorithm for single-processor scheduling problem with learning effect, Minimizing total expected costs in the two-machine, stochastic flow shop, Scheduling and rescheduling elective patients in operating rooms to minimise the percentage of tardy patients, A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops, The nonpermutation flowshop scheduling problem: adjustment and bounding procedures, Two models for a family of flowshop sequencing problems, Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic, Single machine scheduling problem with multiple due windows assignment in a group technology, An improved branch-and-bound algorithm for the two machine total completion time flow shop problem, Genetic multi-criteria approach to flexible line scheduling, A combination of flow shop scheduling and the shortest path problem, Single machine scheduling with symmetric earliness and tardiness penalties, A knowledge-based evolutionary strategy for scheduling problems with bottlenecks, A fast task-to-processor assignment heuristic for real-time multiprocessor DSP applications, Performance guarantees of local search for minsum scheduling problems, A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions, Shop scheduling in manufacturing environments: a review, Mixed coordination mechanisms for scheduling games on hierarchical machines, Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling, SPT optimality (mostly) via linear programming, The balanced maximally diverse grouping problem with integer attribute values, A best possible online algorithm for minimizing the total completion time and the total soft penalty cost, A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints, Minimizing maximum earliness on parallel identical machines, An exponential queue with competition for service, A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times, A flexible flowshop problem with total flow time minimization, Minimizing makespan subject to minimum flowtime on two identical parallel machines, A heuristic approach for single-machine scheduling with due dates and class setups., A new adaptive neural network and heuristics hybrid approach for job-shop scheduling, On preemption redundancy in scheduling unit processing time jobs on two parallel machines, A note on weighted completion time minimization in a flexible flow shop, Sensitivity analysis of scheduling algorithms, Minimizing tardiness in a two-machine flow-shop, Schedule-induced posets, A mixed integer program for loading and scheduling multiple flexible manufacturing cells, A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job, Optimal schedules for single facility with two job classes, Optimal due date assignment in multi-machine scheduling environments, Makespan distribution of permutation flowshop schedules, Scheduling on machines with variable service rates, Exact algorithms for single-machine scheduling with time windows and precedence constraints, Stationary deterministic flows: II. The Single-server queue, Minimizing the maximum deviation of job completion time about a common due-date, Controlling the workload of M/G/1 queues via the \(q\)-policy, The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation, Handling load with less stress, On a scheduling problem where a job can be executed only by a limited number of processors, A two-machine flow shop scheduling problem with controllable job processing times, Cooperative distributed dynamic load balancing, Single facility scheduling with multiple job classes, Transient solutions for some exhaustive M/G/1 queues with generalized independent vacations, On queueing network models of flexible manufacturing systems, An assignment-based lower bound for a class of two-machine flow shop problems, A mixed integer programming approach for the single machine problem with unequal release dates, A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime, Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime, The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective, On scheduling a multiclass queue with abandonments under general delay costs, Real-time scheduling of an automated manufacturing center, Some observations and extensions of the optimal TWK-power due-date determination and sequencing problem, Analysis of channel and disk subsystems in computer systems, The interdeparture-time distribution for each class in the \(\Sigma _ iM_ i/G_ i/1\) queue, A new heuristic method for the flow shop sequencing problem, A new integer programming formulation for the permutation flowshop problem, V-shape property of optimal sequence of jobs about a common due date on a single machine, A fluid approach to large volume job shop scheduling, Scheduling parallel CNC machines with time/cost trade-off considerations, A survey of single machine scheduling to minimize weighted number of tardy jobs, Lower bounds for minimizing total completion time in a two-machine flow shop, Optimal lot streaming for multiple products in a two-machine flow shop, Backtracking of jobs in one-dimensional machine location problems, Problems and methods for multiproduct inventory control in production conditions, Foreword to the thematical issue devoted to the seventieth anniversary of Academician V. S. Tanaev, Scheduling of computational processes in real-time distributed systems with uncertain task execution times, Complexity of problem \(TF2|v=1,c=2|C_{\max}\), Serial batch scheduling on uniform parallel machines to minimize total completion time, Coordination mechanisms with hybrid local policies, Permutation flow shop scheduling with order acceptance and weighted tardiness, Real-time production planning and control system for job-shop manufacturing: a system dynamics analysis, Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates, Search-based job shop scheduling and sequencing: Extensions to the search sequencing rule, Scheduling of project networks, A classification scheme for vehicle routing and scheduling problems, Job oriented production scheduling, Impact of flexible machines on automated manufacturing systems, Scheduling methods for a class of flexible manufacturing systems, A note on minimizing the sum of quadratic completion times on two identical parallel machines, A state-of-the-art review of parallel-machine scheduling research, Priority dispatching rules in a fabrication/assembly shop, Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements, Processor sharing: a survey of the mathematical theory, Waiting time distributions in the accumulating priority queue, How good are SPT schedules for fair optimality criteria, A branch and bound method for the job-shop problem with sequence-dependent setup times, Non-permutation flow shop scheduling with order acceptance and weighted tardiness, Quality assessment of a multistage process in the case of continuous response functions from resource influences, Scheduling jobs with varying processing times, An FPTAS for the parallel two-stage flowshop problem, Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited, Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system, Two machine flow shop scheduling problem with weighted WIP costs, Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints, Waiting time distributions in the preemptive accumulating priority queue, Tradeoff between setup times and carrying costs for finished items, Scheduling time-dependent jobs under mixed deterioration, An improved constraint satisfaction adaptive neural network for job-shop scheduling, Flow shops with WIP and value added costs, Scheduling linearly shortening jobs under precedence constraints, Reexamination of processing time uncertainty, Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments, Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration, Scheduling to minimize the maximum total completion time per machine, Discrete-continuous project scheduling with discounted cash inflows and various payment models -- a review of recent results, Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine, The dynamics of the stream of behavior, Models of central capacity and concurrency, A model of fixed activation time scheduling, Conjugate problems in time-dependent scheduling, Exact and approximate algorithms for high-multiplicity parallel machine scheduling, Scheduling interfering job sets on parallel machines, Approximation ratio of LD algorithm for multi-processor scheduling and the Coffman-Sethi conjecture, Effective optimization methods for single-machine scheduling (survey), New directions in scheduling theory, Scheduling subject to resource constraints: Classification and complexity, The time spent in a dynamic job shop, Mixing of non-preemptive and preemptive repeat priority disciplines, Production planning and scheduling for an integrated container company, Algorithms for two-machine flow-shop sequencing with precedence constraints, Delay analysis of discrete-time priority queue with structured inputs, Tactically delayed versus non-delay scheduling: An experimental investigation, A decomposition approach to multi-project scheduling, State-dependent \(\mathrm{M}/\mathrm{G}/1\) queueing systems, On the consequences of information delays in the scheduling of semi-automated flexible machines
