Current trends in deterministic scheduling
From MaRDI portal
Publication:1374418
DOI10.1023/A:1018909801944zbMATH Open0890.90102OpenAlexW2105413595MaRDI QIDQ1374418FDOQ1374418
Authors: Chung-Yee Lee, Lei Lei, Michael L. Pinedo 
Publication date: 4 December 1997
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018909801944
Recommendations
- Publication:4864756
- scientific article; zbMATH DE number 1487903
- Deterministic job-shop scheduling: Past, present and future
- scientific article; zbMATH DE number 4095196
- New perspectives in scheduling theory
- scientific article; zbMATH DE number 4076943
- scientific article; zbMATH DE number 3989090
- Scheduling and fixed-parameter tractability
- Scheduling and fixed-parameter tractability
hoist schedulingavailability constraintsrobotic cell schedulinglocal search methods1-job-on-\(r\)-machineautomated guided vehicles scheduling
Cited In (74)
- Parallel machine scheduling with machine availability and eligibility constraints
- Genetic algorithm and its performance analysis for scheduling a single crane
- Cost-based decision-making in middleware virtualization environments
- An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times
- Scheduling two-stage hybrid flow shop with availability constraints
- Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems
- Bicriteria robotic cell scheduling
- Isomorphic scheduling problems
- Makespan minimization for parallel machines scheduling with multiple availability constraints
- Maximizing business value by optimal assignment of jobs to resources in grid computing
- Exponential inapproximability and FPTAS for scheduling with availability constraints
- Title not available (Why is that?)
- Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
- Lot streaming in a multiple product permutation flow shop with intermingling
- Single-track multi-hoist scheduling problem: a collision-free resolution based on a branch-and-bound approach
- Total completion time minimization on multiple machines subject to machine availability and makespan constraints
- INTERVAL-VALUED REPRESENTABILITY OF QUALITATIVE DATA: THE CONTINUOUS CASE
- Uniform machine scheduling with machine available constraints
- Scheduling on same-speed processors with at most one downtime on each machine
- Mass customization in videotape duplication and conversion: challenges of flexible duplication systems, fast delivery, and electronic service
- A simple linear time approximation algorithm for multi-processor job scheduling on four processors
- Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint
- Optimization of processing and delivery decisions involving third-party machines
- Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints
- Single machine scheduling with preventive maintenances
- Scheduling in a multi-processor environment with deteriorating job processing times and decreasing values: the case of forest fires
- A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis
- Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times
- Online and semi-online scheduling on capacitated two-parallel machines
- The coordination of single-machine scheduling with availability constraints and delivery
- Preemptive scheduling with availability constraints to minimize total weighted completion times
- Scheduling and constraint propagation
- Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop.
- Scheduling with limited machine availability
- Heuristics for two-machine flowshop scheduling with setup times and an availability constraint
- An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint
- Integrated production scheduling and maintenance policy for robustness in a single machine
- Mathematical models for job-shop scheduling problems with routing and process plan flexibility
- Two-agent single machine scheduling with forbidden intervals
- Minimizing total completion time on a single machine with a flexible maintenance activity
- Hybrid discrete differential evolution algorithm for biobjective cyclic hoist scheduling with reentrance
- Makespan minimization for two parallel machines with an availability constraint
- Hybrid flow-shop scheduling problems with multiprocessor task systems.
- Single-machine scheduling with maintenance and repair rate-modifying activities
- A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks
- Optimal online algorithm for scheduling on two identical machines with machine availability constraints.
- Mean flow time minimization with given bounds of processing times
- A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks
- Two-machine flowshop scheduling with availability constraints
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
- A Lagrangian heuristic for satellite range scheduling with resource constraints
- Heuristics for two-machine no-wait flowshop scheduling with an availability constraint
- Machine scheduling with a rate-modifying activity
- Scheduling with due date assignment under special conditions on job processing
- Scheduling on uniform processors with at most one downtime on each machine
- Two simulated annealing-based heuristics for the job shop scheduling problem
- Machine scheduling with a maintenance interval and job delivery coordination
- Machine scheduling with a maintenance interval and job delivery coordination
- Title not available (Why is that?)
- Scheduling linear deteriorating jobs with an availability constraint on a single machine
- Multi-level lot sizing and job shop scheduling with compressible process times: a cutting plane approach
- Parallel-machine scheduling with potential disruption and positional-dependent processing times
- Title not available (Why is that?)
- Title not available (Why is that?)
- Deterministic Search Algorithm for Sequencing and Scheduling
- Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval
- Two-machine flow shop scheduling integrated with preventive maintenance planning
- Minimising total flow-time on two parallel machines with planned downtimes and resumable jobs
- Optimality of Jackson's permutations with respect to limited machine availability
- Route-enabling graph orientation problems
- Multiple crane scheduling in a batch annealing process with no-delay constraints for machine unloading
- Predicting the optimal period for Cyclic Hoist Scheduling Problems
- Scheduling jobs with service level requirements on parallel machines under availability and eligibility constraints
- A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing
This page was built for publication: Current trends in deterministic scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1374418)
