Publication:3525910
From MaRDI portal
zbMath1145.90393MaRDI QIDQ3525910
Publication date: 22 September 2008
90B35: Deterministic scheduling theory in operations research
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
Related Items
Effect of load, processing time and due date variation on the effectiveness of scheduling rules, Linguistic-based meta-heuristic optimization model for flexible job shop scheduling, Deadlock-free scheduling in flexible manufacturing systems using Petri nets, Two-machine flowshop minimum-length scheduling problem with random and bounded processing times, Minimizing makespan on parallel machines with release time and machine eligibility restrictions, An empirical analysis of algorithms for partially Clairvoyant scheduling, Multiplicity and complexity issues in contemporary production scheduling, A mathematical programming model for multiple integrated MRP planning stages, Scheduling concurrent production over a finite planning horizon: Polynomially solvable cases, A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs, An approach to determine storage locations of containers at seaport terminals, Scheduling experiments on a nulear reactor using mixed integer programming, Fuzzy flexible flow shops at two machine centers for continuous fuzzy domains, A note on weighted completion time minimization in a flexible flow shop, Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates, Rotation cycle schedulings for multi-item production systems., Workface planning in synchronous production systems, Single-machine scheduling with maintenance and repair rate-modifying activities, Fabrication scheduling on a single machine with due date constraints, Counting and enumeration complexity with application to multicriteria scheduling, Two simulated annealing-based heuristics for the job shop scheduling problem, Scheduling of industrial distribution manifolds with pre-conditions, An iterative improvement approach for the nonpreemptive open shop scheduling problem, Stochastically minimizing the makespan in two-machine flow shops without blocking, Analysis of the twisting department at superior cable corporation: A case study, The three-machine proportionate flow shop problem with unequal machine speeds, Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound, Single machine earliness-tardiness scheduling with resource-dependent release dates, Review of properties of different precedence graphs for scheduling problems, Job-shop scheduling with blocking and no-wait constraints, Development and analysis of cost-based dispatching rules for job shop scheduling, Parallel machine scheduling under a grade of service provision, Minimizing total weighted tardiness on a single batch process machine with incompatible job families, Scheduling two-machine preemptive open shops to minimize total completion time, Total completion time minimization in a computer system with a server and two parallel processors, Flow-shop scheduling for three serial stations with the last two duplicate, A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem, The simple \(F2//C \max\) with forbidden tasks in first or last position: a problem more complex that it seems, Resolution of a scheduling problem in a flowshop robotic cell, Markovian analysis for performance evaluation and scheduling in \(m\) machine stochastic flow-shop with buffers of any capacity, A note on flow-shop and job-shop batch scheduling with identical processing-time jobs, Mean flow time minimization with given bounds of processing times, A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation, On the fixed interval due-date scheduling problem, An iterative heuristic for the single machine dynamic total completion time scheduling problem, Scheduling of a machining center, Polynomial time algorithms for the UET permutation flowshop problem with time delays, Flow shop scheduling jobs with position-dependent processing times, Parallel machine selection and job scheduling to minimize machine cost and job tardiness, Aversion scheduling in the presence of risky jobs, Evaluation of entropy-based dispatching in flexible manufacturing systems, Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times, An analysis of totally clairvoyant scheduling, Multicriteria optimisation and simulation: an industrial application, A polynomial time algorithm for Zero-Clairvoyant scheduling, Scheduling a two-stage flowshop under makespan constraint, Optimal spacecraft support in remote sensing missions, Web server QoS models: applying scheduling rules from production planning, Comparison of heuristics for flowtime minimisation in permutation flowshops, Mixed integer formulation to minimize makespan in a flow shop with batch processing machines, The complexity of machine scheduling for stability with a single disrupted job, Asymptotically optimal schedules for single-server flow shop problems with setup costs and times, Stochastic optimization using simulated annealing with hypothesis test, Scheduling advertisements on a web page to maximize revenue, Fix and relax heuristic for a stochastic lot-sizing problem, A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times, Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops, Petri net based scheduling, Machine scheduling with an availability constraint, Scheduling unit length jobs with parallel nested machine processing set restrictions, A framework for the complexity of high-multiplicity scheduling problems, Flowshop scheduling research after five decades, Applying machine based decomposition in 2-machine flow shops, Minimizing makespan on a single machine subject to random breakdowns, Machine scheduling performance with maintenance and failure, A Two-Stage Flexible Flowshop Problem with Deterioration, Recent sojourn time results for multilevel processor‐sharing scheduling disciplines, Sensitivity analysis for some scheduling problems, A network flow model of group technology, Scheduling and constraint propagation, Manufacturing lead-time rules: customer retention versus tardiness costs, Approximation algorithms for \(k\)-unit cyclic solutions in robotic cells, Scheduling preemptive open shops to minimize total tardiness, A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem, Average-case analysis of best-first search in two representative directed acyclic graphs, A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking, On a fix-and-relax framework for a class of project scheduling problems, An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times, Minimizing total completion time in a two-machine flow shop with deteriorating jobs, Necessary and sufficient conditions of optimality for some classical scheduling problems, A genetic algorithms simulation approach for the multi-attribute combinatorial dispatching decision problem, Cyclic multiple-robot scheduling with time-window constraints using a critical path approach, Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time, A multi-objective particle swarm for a flow shop scheduling problem, An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups, Simple heuristics for scheduling with limited intermediate storage, Scheduling a hybrid flowshop with batch production at the last stage, A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families, Job scheduling methods for reducing waiting time variance, Evaluating solution sets of a posteriori solution techniques for bi-criteria combinatorial optimization problems, Sequencing and scheduling in robotic cells: recent developments, Minimizing total weighted tardiness in a generalized job shop, Discovering dispatching rules using data mining, An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness, On a parallel machine scheduling problem with precedence constraints, Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication, Single processor scheduling with job values depending on their completion times, Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem, Using simulation and multi-criteria methods to provide robust solutions to dispatching problems in a flow shop with multiple processors, Column generation heuristics for multiple machine, multiple orders per job scheduling problems, A zero-inventory production and distribution problem with a fixed customer sequence, Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times, Flow shop scheduling with effects of learning and deterioration, The impact of operations redesign on the safety stock investment in supply chains, Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm, Maximizing business value by optimal assignment of jobs to resources in grid computing, Minmax scheduling problems with a common due-window, Scheduling of design projects with uncertain number of iterations, The job shop scheduling problem: Conventional and new solution techniques, Batch scheduling with deadlines on parallel machines, Lot sizing and scheduling -- survey and extensions, The complexity of multidimensional periodic scheduling, A three-dimensional matching model for perishable production scheduling, Impact of learning and fatigue factors on single machine scheduling with penalties for tardy jobs, On stochastic machine scheduling with general distributional assumptions, Two-machine flowshop scheduling with availability constraints, Benchmarks for shop scheduling problems, Heuristics for the flow line problem with setup costs, Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism, Multi-period job selection: Planning work loads to maximize profit, Using information about machine failures to control flowlines, Stability of a schedule minimizing mean flow time, Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint, Look ahead job demanding for improving job shop performance, Optimal makespan scheduling with given bounds of processing times, A heuristic algorithm for mean flowtime objective in flowshop scheduling, The lazy bureaucrat scheduling problem, Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times., Resource-constrained project scheduling: A survey of recent developments., Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups., Using global search heuristics for the capacity vehicle routing problem., A concise survey of scheduling with time-dependent processing times, A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage., A contribution to the stochastic flow shop scheduling problem., QoS guided min-min heuristic for grid task scheduling, Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints., Complexity and approximation results for scheduling multiprocessor tasks on a ring., Minimizing the makespan for the flow shop scheduling problem with availability constraints., An efficient tabu search approach for the two-machine preemptive open shop scheduling problem., A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines., Parallel machine scheduling of machine-dependent jobs with unit-length., Improved genetic algorithm for the permutation flowshop scheduling problem., An ant colony system for permutation flow-shop sequencing, A hybrid genetic algorithm for the open shop scheduling problem, A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups, On three-machine flow shops with random job processing times, Efficiency of reductions of job-shop to flow-shop problems, Minmax regret solutions for minimax optimization problems with uncertainty, Machine scheduling with a rate-modifying activity, An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns, Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure, Dynamic scheduling of stochastic jobs on a single machine, A survey of the state-of-the-art of common due date assignment and scheduling research, Scheduling one-part-type serial manufacturing system under periodic demand: A solvable case, Extending Graham's result on scheduling to other heuristics, Planning the project management way: Efficient planning by effective integration of causal and resource reasoning in RealPlan, The convergence of stochastic algorithms solving flow shop scheduling, Tabu search for resource-constrained scheduling, A comparative study of dispatching rules in dynamic flowshops and jobshops, Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints, Minimizing the expected number of tardy jobs when processing times are normally distributed, Single machine scheduling with assignable due dates, Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling, A hybrid framework for over-constrained generalized resource-constrained project scheduling problems, A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem, Enhancing router QoS through job scheduling with weighted shortest processing time-adjusted, Sequencing the processing of incoming mail to match an outbound truck delivery schedule, A computational study of the permutation flow shop problem based on a tight lower bound
