scientific article
From MaRDI portal
Publication:3525910
zbMath1145.90393MaRDI QIDQ3525910
Publication date: 22 September 2008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Single machine scheduling with assignable due dates, 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, Empirical analysis of algorithms for the shortest negative cost cycle problem, 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, 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, Optimal makespan scheduling with given bounds of processing times, Batch picking in narrow-aisle order picking systems with consideration for picker blocking, 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., Improved algorithms for optimal length resolution refutation in difference constraint systems, Proportionate flowshops with general position-dependent processing 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., Lot scheduling on a single machine to minimize the (weighted) number of tardy orders, 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., Time-bounded termination analysis for probabilistic programs with delays, Parallel machine scheduling of machine-dependent jobs with unit-length., Multiobjective order acceptance and scheduling on unrelated parallel machines with machine eligibility constraints, Improved genetic algorithm for the permutation flowshop scheduling problem., An ant colony system for permutation flow-shop sequencing, Four decades of research on the open-shop scheduling problem to minimize the makespan, Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times, A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems, Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective, Online scheduling of two job types on a set of multipurpose machines with unit processing times, An ant colony optimization algorithm for load balancing in parallel machines with sequence-dependent setup times, Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints, Heuristics for an assembly flow-shop with non-identical assembly machines and sequence dependent setup times to minimize sum of holding and delay costs, 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, No-wait flow shop scheduling using fuzzy multi-objective linear programming, Nested partitions for the large-scale extended job shop scheduling problem, 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, Scheduling jobs with release and delivery times subject to nested eligibility constraints, 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, Logic-based Benders decomposition method for the \textit{seru} scheduling problem with sequence-dependent setup time and DeJong's learning effect, A hybrid genetic algorithm for the open shop scheduling problem, A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups, Impact of learning and fatigue factors on single machine scheduling with penalties for tardy jobs, On stochastic machine scheduling with general distributional assumptions, On three-machine flow shops with random job processing times, Efficiency of reductions of job-shop to flow-shop problems, Two-machine flowshop scheduling with availability constraints, Benchmarks for shop scheduling problems, 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, Heuristics for the flow line problem with setup costs, Minmax regret solutions for minimax optimization problems with uncertainty, Machine scheduling with a rate-modifying activity, Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism, 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, An improved two-machine flowshop scheduling with intermediate transportation, Batch scheduling with deadlines on parallel machines: an NP-hard case, A tabu search heuristic for the quay crane scheduling problem, Proactive and reactive strategies for resource-constrained project scheduling with uncertain resource availabilities, The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost, Optimal length resolution refutations of difference constraint systems, 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, A holonic approach to flexible flow shop scheduling under stochastic processing times, NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness, A discrete inter-species cuckoo search for flowshop scheduling problems, Weighted tardiness for the single machine scheduling problem:an examination of precedence theorem productivity, A heuristic method for two-stage hybrid flow shop with dedicated machines, Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness, Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time, Evaluation of mathematical models for flexible job-shop scheduling problems, 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, A network flow model of group technology, Scheduling a hybrid flowshop with batch production at the last stage, Scheduling of design projects with uncertain number of iterations, 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, A cooperative hyper-heuristic search framework, 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, On multiprocessor temperature-aware scheduling problems, On the negative cost girth problem in planar networks, Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times, Optimization models for assessing the peak capacity utilization of intelligent transportation systems, Batch scheduling in a two-stage flexible flow shop problem, Some single-machine scheduling problems with general effects of learning and deterioration, Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect, Two-machine flowshop scheduling with intermediate transportation under job physical space consideration, Scheduling jobs with equal processing times subject to machine eligibility constraints, Cutting stock with no three parts per pattern: work-in-process and pattern minimization, Distributed algorithmic mechanism design for scheduling on unrelated machines, Improving fleet utilization for carriers by interval scheduling, A strongly polynomial FPTAS for the symmetric quadratic knapsack problem, Extended beam search for non-exhaustive state space analysis, Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem, Scheduling unit length jobs on parallel machines with lookahead information, Using simulation and multi-criteria methods to provide robust solutions to dispatching problems in a flow shop with multiple processors, OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises, 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, Single machine past-sequence-dependent setup times scheduling with general position-dependent and time-dependent learning effects, Scheduling \(UET\)-tasks on a star network: complexity and approximation, Scheduling and constraint propagation, The museum visitor routing problem, Minimizing total weighted flow time of a set of jobs with interval processing times, Notes on ``Some single-machine scheduling problems with general position-dependent and time-dependent learning effects, The Browne-Yechiali single-machine sequence is optimal for flow-shops, Manufacturing lead-time rules: customer retention versus tardiness costs, Approximation algorithms for \(k\)-unit cyclic solutions in robotic cells, The production scheduling problem in a multi-page invoice printing system, Scheduling preemptive open shops to minimize total tardiness, A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem, Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration, Improved bounds for online scheduling with eligibility constraints, Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem, Throughput-optimal sequences for cyclically operated plants, Minmax scheduling problems with a common due-window, A contribution and new heuristics for open shop scheduling, Learning heuristics for basic block instruction scheduling, A genetic algorithm for the proportionate multiprocessor open shop, The job shop scheduling problem: Conventional and new solution techniques, Batch scheduling with deadlines on parallel machines, Solution approaches for the soft drink integrated production lot sizing and scheduling problem, A new heuristic algorithm for the machine scheduling problem with job delivery coordination, Exponential inapproximability and FPTAS for scheduling with availability constraints, Lot sizing and scheduling -- survey and extensions, The complexity of multidimensional periodic scheduling, A three-dimensional matching model for perishable production scheduling, Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness, Heuristics and exact methods for number partitioning, A tabu search algorithm for scheduling pharmaceutical packaging operations, On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls, Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants, Scheduling jobs under decreasing linear deterioration, A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times, Two parallel machines problem with job delivery coordination and availability constraint, 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, Quebec provincial government evaluates the potential of OR in the midst of its forest regime renewal, RETRACTED ARTICLE: Approach towards problem solving on single machine scheduling with unequal release dates and learning effect, Evaluation of the expected makespan of a set of non-resumable jobs on parallel machines with stochastic failures, Two-machine flowshop minimum-length scheduling problem with random and bounded processing times, 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, Machine scheduling performance with maintenance and failure, Single-machine scheduling with general learning functions, Schedule execution for two-machine flow-shop with interval processing times, Minimizing makespan on parallel machines with release time and machine eligibility restrictions, An examination of job interchange relationships and induction-based proofs in single machine scheduling, Single Machine Scheduling with an Availability Constraint and Rejection, Scatter search for minimizing weighted tardiness in a single machine scheduling with setups, The pairwise flowtime network construction problem, Modeling and solving the problem of scheduling university exams in terms of new constraints on the conflicts of professors' exams and the concurrence of exams with common questions, A Bicriteria Scheduling Problem with a Learning Effect: Total Completion Time and Total Tardiness, A Two-Stage Flexible Flowshop Problem with Deterioration, On the complexity of proportionate open shop and job shop problems, Adaptive multimeme algorithm for flexible job shop scheduling problem, Aversion scheduling in the presence of risky jobs, Evaluation of entropy-based dispatching in flexible manufacturing systems, Single machine scheduling with delivery dates and cumulative payoffs, Recent sojourn time results for multilevel processor‐sharing scheduling disciplines, Scheduling with a position-weighted learning effect, Single-facility scheduling by logic-based Benders decomposition, Sensitivity analysis for some scheduling problems, Integrated production planning and preventive maintenance in deteriorating production systems, Uncertainty measure for the Bellman-Johnson problem with interval processing times, Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times, An analysis of totally clairvoyant scheduling, Combinação de abordagens GLSP e ATSP para o problema de dimensionamento e sequenciamento de lotes de produção de suplementos para nutrição animal, 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, Scheduling concurrent production over a finite planning horizon: Polynomially solvable cases, An empirical analysis of algorithms for partially Clairvoyant scheduling, Web server QoS models: applying scheduling rules from production planning, Comparison of heuristics for flowtime minimisation in permutation flowshops, Multiplicity and complexity issues in contemporary production scheduling, A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs, 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, 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, Scheduling advertisements on a web page to maximize revenue, A mathematical programming model for multiple integrated MRP planning stages, A note on weighted completion time minimization in a flexible flow shop, Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling, 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, Fix and relax heuristic for a stochastic lot-sizing problem, Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm, Uma propriedade estrutural do problema de programação da produção flow shop permutacional com tempos de setup, A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times, 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, Malleable scheduling for flows of jobs and applications to MapReduce, Counting and enumeration complexity with application to multicriteria scheduling, A Survey on Approximation Algorithms for Scheduling with Machine Unavailability, Forward Backward Transformation, Discrete Set Handling, TWO-MACHINE FLOW-SHOP MINIMUM-LENGTH SCHEDULING WITH INTERVAL PROCESSING 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, Single machine predictive scheduling using inserted idle times, Scheduling the Flowshop with Zero Intermediate Storage Using Chaotic Discrete Artificial Bee Algorithm, Complex Network Analysis of Discrete Self-organising Migrating Algorithm, Minimizing makespan on a single machine subject to random breakdowns
