scientific article

From MaRDI portal
Publication:3938812

zbMath0479.90037MaRDI QIDQ3938812

Simon French

Publication date: 1982


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

Design of components for schedulability, Feasibility of scheduling lot sizes of two frequencies on one machine, The two-machine sequence dependent flowshop scheduling problem, The stochastic single machine scheduling problem with earliness and tardiness costs, Optimal schedules for single facility with two job classes, An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal, Combinatorial optimization techniques for spacecraft scheduling automation, A scheduling problem in a semi-open job shop -- the case of a cordset manufacturing company, Job-shop scheduling with convex models of operations, A bicriterion objective for levelling the schedule of a mixed-model, \(JIT\) assembly process, Adjustment of heads and tails for the job-shop problem, Development of a heuristic project scheduler under resource constraints, A decision support system for the resource constrained project scheduling problem, A genetic algorithm for the job shop problem, Evolution based learning in a job shop scheduling environment, Scheduling on machines with variable service rates, A hybrid evolutionary algorithm to solve the job shop scheduling problem, Single facility scheduling with multiple job classes, Scheduling with compressible and stochastic release dates, A tabu method for a two-agent single-machine scheduling with deterioration jobs, New trends in machine scheduling, An investigation on a two-agent single-machine scheduling problem with unequal release dates, Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics, A survey of priority rule-based scheduling, Solving a concrete sleepers production scheduling by genetic algorithms, Scheduling the truckload operations in automatic warehouses, Real-time scheduling of an automated manufacturing center, An exact algorithm for project scheduling with multiple modes, Petri nets for the design and operation of manufacturing systems, An \(O(n \log^ 2\,n)\) algorithm for the maximum weighted tardiness problem, k-optimal solution sets for some polynomially solvable scheduling problems, General stochastic single-machine scheduling with regular cost functions, A survey of single machine scheduling to minimize weighted number of tardy jobs, Minimizing total tardiness in permutation flowshops, Optimal lot streaming for multiple products in a two-machine flow shop, Minimizing the number of tardy jobs for \(m\) parallel machines, Resource-constrained job scheduling with recyclable resources, Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem, Multiple and bicriteria scheduling: A literature survey, Some thoughts on combinatorial optimisation, Generalized pairwise interchanges and machine scheduling, Heuristics for scheduling in flowshop with multiple objectives, Heuristic procedures for minimizing makespan and the number of required pallets, Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation, Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times., Model approximation for batch flow shop scheduling with fixed batch sizes, Resource-constrained project scheduling: A survey of recent developments., Group scheduling with deteriorating jobs to minimize the total weighted number of late jobs, On the continuous working problem, Single facility multi-class job scheduling, Scheduling flexible machining and assembly systems, Scheduling methods for a class of flexible manufacturing systems, Multi-level production scheduling for a class of flexible machining and assembly systems, Automated knowledge source selection and service composition, A state-of-the-art review of parallel-machine scheduling research, Hybrid algorithms for hardware/software partitioning and scheduling on reconfigurable devices, Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem, A nonlinear mixed integer goal programming model for the two-machine closed flow shop, Production scheduling problems in a textile industry, A new dynamic programming algorithm for the parallel machines total weighted completion time problem, Scheduling with neural networks -- the case of the Hubble Space Telescope, Use of variable range in solving multiple criteria scheduling problems, Tradeoff between setup times and carrying costs for finished items, Flow-shops with a dominant machine, A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions, Capacitated two-parallel machines scheduling to minimize sum of job completion times, An improved constraint satisfaction adaptive neural network for job-shop scheduling, Three-stage flow-shop scheduling with assembly operations to minimize the weighted sum of product completion times, Optimal control of production processes with variable execution times, KBSS: A knowledge-based system for scheduling in automated manufacturing, A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops, Establishment of economic production rate, production batch size, and production sequence in manufacturing systems with flexible routing, Hybrid rollout approaches for the job shop scheduling problem, A computational study of constraint satisfaction for multiple capacitated job shop scheduling, An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem, Minimizing mean tardiness subject to unspecified minimum number tardy for a single machine, The job shop scheduling problem: Conventional and new solution techniques, A simulated annealing approach for the one-machine mean tardiness scheduling problem, Scheduling multiprocessor tasks with chain constraints, Sequencing jobs for an automated manufacturing module with buffer, An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs, Heuristic for scheduling in a Kanban system with dual blocking mechanisms, The complexity of multidimensional periodic scheduling, Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization, Scheduling installations in the telecommunications industry, Impact of learning and fatigue factors on single machine scheduling with penalties for tardy jobs, A tabu search approach for the flow shop scheduling problem, Reduction of job-shop problems to flow-shop problems with precedence constraints, New directions in scheduling theory, A variant of time minimizing assignment problem, Local search procedures for improving feasible solutions to the sequential ordering problem, Network planning for scheduling operations in air cargo handling: a tool in medium term goodsflow control, Some remarks about the `equivalence' of performance measures in scheduling problems, A heuristic for cyclic stochastic sequencing of tasks on a drum-like storage system, Branch and bound algorithm for the flow shop with multiple processors, Open shops with jobs overlap, Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment, Mathematical programming formulations for machine scheduling: A survey, Single-machine scheduling to minimize earliness and number of tardy jobs, Optimal scheduling in film production to minimize talent hold cost, Minimizing the weighted number of tardy jobs on multiple machines: a review, One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective, Stochastic scheduling subject to machine breakdowns: The preemptive-repeat model with discounted reward and other criteria, Development and analysis of cost-based dispatching rules for job shop scheduling, An improved shifting bottleneck procedure for the job shop scheduling problem, Routing and scheduling in a flexible job shop by tabu search, Unnamed Item, A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time, Solving multi-objective production scheduling problems using metaheuristics, A backward approach in list scheduling algorithms for multi-machine tardiness problems, Partitioning sequencing situations and games, Particle swarm optimization combined with genetic operators for job shop scheduling problem with fuzzy processing time, A generalized permutation approach to job shop scheduling with genetic algorithms, Focused simulated annealing search: An application to job shop scheduling, Single Machine Stochastic Scheduling: Minimizing the Number of Tardy Jobs, A simple proof of the Moore-Hodgson algorithm for minimizing the number of late jobs, Immersed NURBS for CFD Applications, Classification of Ship Routing and Scheduling Problems in Liner Shipping, A composite heuristic for the single machine early/tardy job scheduling problem., Optimization of setup times in the furniture industry, A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage., Single-facility scheduling by logic-based Benders decomposition, The Machine Duplication Problem in a Job Shop with Two Jobs, Analyzing variability in continuous processes., Metaheuristics for order scheduling problem with unequal ready times, Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect, A tabu search method guided by shifting bottleneck for the job shop scheduling problem, Fuzzy programming for multiobjective job shop scheduling with fuzzy processing time and fuzzy duedate through genetic algorithms, An Extensive Tabu Search Algorithm for Solving the Lot Streaming Problem in a Job Shop Environment, Bicriteria scheduling with vacations on a single machine, Simulated annealing algorithm for solving the single machine early/tardy problem, Flow-shop scheduling with setup and assembly operations, The bilevel optimisation of a multi-agent project scheduling and staffing problem, A lexi-search algorithm for a time minimizing assignment problem., A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures, An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling, A new particle swarm optimization for the open shop scheduling problem, Mathematical models for preemptive shop scheduling problems, A hybrid genetic algorithm for the job shop scheduling problem, Flexible process plans: their value in flexible automation systems, Scheduling a single batch processing machine with non-identical job sizes, A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria, Mixed binary integer programming formulations for the reentrant job shop scheduling problem, A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times, An experimental investigation of scheduling non-identical, parallel processors with sequence-dependent set-up times and due dates, A hierarchical bicriterion approach to integrated process plan selection and job shop scheduling, Design and scheduling of flexible assembly lines for printed circuit boards, Continuous flow models for batch manufacturing: a basis for a hierarchical approach, Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria, Optimal and heuristic solutions for a scheduling problem arising in a foundry, A new adaptive neural network and heuristics hybrid approach for job-shop scheduling, Minimizing maximum tardiness in single FMS machine scheduling with tool changes, Simultaneous price and due date settings for multiple customer classes, Scheduling flexible manufacturing cells using Tabu Search, Effective heuristics for the single machine sequencing problem with ready times, A new heuristic for the n-job, M-machine flow-shop problem, Mathematical Modeling of Scheduling Problems, A meta-heuristic to solve the just-in-time job-shop scheduling problem, Minimizing tardiness in a two-machine flow-shop, The single-machine total tardiness problem with unequal release times and a linear deterioration, Coordinated scheduling of customer orders for quick response, Uma propriedade estrutural do problema de programação da produção flow shop permutacional com tempos de setup, A research survey: review of flexible job shop scheduling techniques, Exploiting process plan flexibility in production scheduling: A multi-objective approach, Analysis of the twisting department at superior cable corporation: A case study, An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop, A new hybrid parallel genetic algorithm for the job‐shop scheduling problem, Petri net based scheduling, A General Framework for Stochastic One-machine Scheduling Problems with Zero Release Times and No Partial Ordering, A Note on One-Machine Scheduling Problems with Imperfect Information, A study of integer programming formulations for scheduling problems, Single machine earliness-tardiness scheduling with resource-dependent release dates, Job-shop scheduling with blocking and no-wait constraints, Model formulations for the machine scheduling problem with limited waiting time constraints, Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time, A production and maintenance planning model for the process industry, Formulations and heuristics for scheduling in a buffer-constrained flowshop and flowline-based manufacturing cell with different buffer-space requirements for jobs: Part 1, An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns, Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling, Single machine scheduling with symmetric earliness and tardiness penalties, A comparative study of dispatching rules in dynamic flowshops and jobshops, Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling