Principles of Sequencing and Scheduling
From MaRDI portal
Publication:3632904
DOI10.1002/9780470451793zbMath1169.90009OpenAlexW4229644324MaRDI QIDQ3632904
Dan Trietsch, Kenneth R. Baker
Publication date: 15 June 2009
Full work available at URL: https://doi.org/10.1002/9780470451793
project schedulingschedulingsequencingheuristic algorithmsparallel machine problemsoptimization methodssingle machine problemsmulti-stage problems
Deterministic scheduling theory in operations research (90B35) Stochastic scheduling theory in operations research (90B36) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (48)
PROJECT MANAGEMENT GAMES ⋮ Three-machine flow shop scheduling with overlapping waiting time constraints ⋮ On the flexibility of a decision theory-based heuristic for single machine scheduling ⋮ Pooling heterogeneous products for manufacturing environments ⋮ Group-shop scheduling with sequence-dependent set-up and transportation times ⋮ Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms ⋮ Setting optimal due dates in a basic safe-scheduling model ⋮ Decomposition based hybrid VNS-TS algorithm for distributed parallel factories scheduling with virtual corporation ⋮ Weighted tardiness for the single machine scheduling problem:an examination of precedence theorem productivity ⋮ A single machine carryover sequence-dependent group scheduling in PCB manufacturing ⋮ Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies ⋮ Evaluation of mathematical models for flexible job-shop scheduling problems ⋮ Solving a stochastic single machine problem with initial idle time and quadratic objective ⋮ Sum-of-processing-times-based two-agent single-machine scheduling with aging effects and tardiness ⋮ An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines ⋮ A real-world mine excavators timetabling methodology in open-pit mining ⋮ Shop scheduling in manufacturing environments: a review ⋮ Joint production and preventive maintenance scheduling for a single degraded machine by considering machine failures ⋮ Two-machine flow shop scheduling with convex resource consumption functions ⋮ A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking ⋮ Evaluation of the quantiles and superquantiles of the makespan in interval valued activity networks ⋮ A multi-objective approach for manufacturing systems with multiple production routes based on supervisory control theory and heuristic algorithms ⋮ A note on the shifting bottleneck procedure for job shop scheduling ⋮ An efficient implementation of a VNS heuristic for the weighted fair sequences problem ⋮ Significantly improved dominance relation for no-wait flowshop scheduling problems with uncertain setup times ⋮ Dominance rules in combinatorial optimization problems ⋮ Comments on ``A bicriteria \(m\)-machine flowshop scheduling with sequence-dependent setup times ⋮ A hybrid metaheuristic approach for minimizing the total flow time in a flow shop sequence dependent group scheduling problem ⋮ A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times ⋮ New competitive results for the stochastic resource-constrained project scheduling problem: exploring the benefits of pre-processing ⋮ Scheduling steel plates on a roller furnace ⋮ Unnamed Item ⋮ Proactive policies for the stochastic resource-constrained project scheduling problem ⋮ A Batch Scheduling Problem with Two Agents ⋮ A polynomial-time scheduling approach to minimise idle energy consumption: an application to an industrial furnace ⋮ Survey on fuzzy shop scheduling ⋮ Stochastic single machine scheduling problem as a multi-stage dynamic random decision process ⋮ Heuristic for stochastic online flowshop problem with preemption penalties ⋮ Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines ⋮ Approximated timed reachability graphs for the robust control of discrete event systems ⋮ Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling ⋮ Proportionate flow shop: New complexity results and models with due date assignment ⋮ An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors -- a case study ⋮ Maintenance optimization with duration-dependent costs ⋮ Bi-objective single machine scheduling problem with stochastic processing times ⋮ One-Machine Sequencing to Minimize Total Tardiness: A Fourth Theorem for Emmons ⋮ Trading off due-date tightness and job tardiness in a basic scheduling model ⋮ Minimizing earliness and tardiness costs in stochastic scheduling
This page was built for publication: Principles of Sequencing and Scheduling