scientific article; zbMATH DE number 2146482

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.

Mathematics Subject Classification ID

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 (only showing first 100 items - show all)

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

This page was built for publication: