scientific article

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 (only showing first 100 items - show all)

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 ⋮ Joint decision-making for divisional \textit{seru} scheduling and worker assignment considering process sequence constraints ⋮ 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 ⋮ 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

This page was built for publication: