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




Related Items (48)

PROJECT MANAGEMENT GAMESThree-machine flow shop scheduling with overlapping waiting time constraintsOn the flexibility of a decision theory-based heuristic for single machine schedulingPooling heterogeneous products for manufacturing environmentsGroup-shop scheduling with sequence-dependent set-up and transportation timesParallel Machine Scheduling Under Uncertainty: Models and Exact AlgorithmsSetting optimal due dates in a basic safe-scheduling modelDecomposition based hybrid VNS-TS algorithm for distributed parallel factories scheduling with virtual corporationWeighted tardiness for the single machine scheduling problem:an examination of precedence theorem productivityA single machine carryover sequence-dependent group scheduling in PCB manufacturingScheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategiesEvaluation of mathematical models for flexible job-shop scheduling problemsSolving a stochastic single machine problem with initial idle time and quadratic objectiveSum-of-processing-times-based two-agent single-machine scheduling with aging effects and tardinessAn \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machinesA real-world mine excavators timetabling methodology in open-pit miningShop scheduling in manufacturing environments: a reviewJoint production and preventive maintenance scheduling for a single degraded machine by considering machine failuresTwo-machine flow shop scheduling with convex resource consumption functionsA comparative study on three graph-based constructive algorithms for multi-stage scheduling with blockingEvaluation of the quantiles and superquantiles of the makespan in interval valued activity networksA multi-objective approach for manufacturing systems with multiple production routes based on supervisory control theory and heuristic algorithmsA note on the shifting bottleneck procedure for job shop schedulingAn efficient implementation of a VNS heuristic for the weighted fair sequences problemSignificantly improved dominance relation for no-wait flowshop scheduling problems with uncertain setup timesDominance rules in combinatorial optimization problemsComments on ``A bicriteria \(m\)-machine flowshop scheduling with sequence-dependent setup timesA hybrid metaheuristic approach for minimizing the total flow time in a flow shop sequence dependent group scheduling problemA single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion timesNew competitive results for the stochastic resource-constrained project scheduling problem: exploring the benefits of pre-processingScheduling steel plates on a roller furnaceUnnamed ItemProactive policies for the stochastic resource-constrained project scheduling problemA Batch Scheduling Problem with Two AgentsA polynomial-time scheduling approach to minimise idle energy consumption: an application to an industrial furnaceSurvey on fuzzy shop schedulingStochastic single machine scheduling problem as a multi-stage dynamic random decision processHeuristic for stochastic online flowshop problem with preemption penaltiesSingle-machine batch scheduling to minimize the total setup cost in the presence of deadlinesApproximated timed reachability graphs for the robust control of discrete event systemsNear-optimal heuristics for just-in-time jobs maximization in flow shop schedulingProportionate flow shop: New complexity results and models with due date assignmentAn improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors -- a case studyMaintenance optimization with duration-dependent costsBi-objective single machine scheduling problem with stochastic processing timesOne-Machine Sequencing to Minimize Total Tardiness: A Fourth Theorem for EmmonsTrading off due-date tightness and job tardiness in a basic scheduling modelMinimizing earliness and tardiness costs in stochastic scheduling




This page was built for publication: Principles of Sequencing and Scheduling