Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Makespan minimization for two parallel machines scheduling with a periodic availability constraint
- Scheduling hybrid flowshop with parallel batching machines and compatibilities
- Minimizing total completion time in two-machine flow shops with exact delays
- Interval-indexed formulation based heuristics for single machine total weighted tardiness problem
- Preemptive scheduling and antichain polyhedra
- An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems
- Sequencing mixed-model assembly lines: survey, classification and model critique
- Johnson's rule, composite jobs and the relocation problem
- Note on Shim and Kim's lower bounds for scheduling on identical parallel machines to minimize total tardiness
- Planning production using mathematical programming: The case of a woodturning company
- LP-based online scheduling: From single to parallel machines
- An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan
- Preemptive online scheduling: Optimal algorithms for all speeds
- Single machine precedence constrained scheduling is a Vertex cover problem
- Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
- On-line scheduling with delivery time on a single batch machine
- Exponential inapproximability and FPTAS for scheduling with availability constraints
- A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
- Single machine scheduling problems with position-dependent processing times
- Scheduling multiprocessor UET tasks of two sizes
- Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead
- Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness
- Scheduling identical jobs and due-window on uniform machines
- Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop
- Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations
- The single-machine total tardiness scheduling problem: review and extensions
- Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan
- A tabu search algorithm for scheduling pharmaceutical packaging operations
- Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines
- Minimizing total weighted completion time on single machine with past-sequence-dependent setup times and exponential time-dependent and position-dependent learning effects
- The distributed permutation flowshop scheduling problem
- Non-approximability of just-in-time scheduling
- Exact and approximate algorithms for high-multiplicity parallel machine scheduling
- Scheduling jobs under decreasing linear deterioration
- Scheduling interfering job sets on parallel machines
- Time-indexed formulations for scheduling chains on a single machine: an application to airborne radars
- Scheduling subject to resource constraints: Classification and complexity
- On the complexity of preemptive open-shop scheduling problems
- A block approach for single-machine scheduling with release dates and due dates
- Scheduling tasks on two processors with deadlines and additional resources
- Minimizing mean flow time with parallel processors and resource constraints
- The rate of convergence to optimality of the LPT rule
- Scheduling on machines with variable service rates
- Multiprocessor scheduling with interprocessor communication delays
- On a scheduling problem where a job can be executed only by a limited number of processors
- New trends in machine scheduling
- Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival
- Scheduling algorithms based on necessary optimality conditions
- A new integer programming formulation for the permutation flowshop problem
- An algorithm for single machine sequencing with release dates to minimize maximum cost
- Scheduling unit-time jobs on processors with different capabilities
- Cost-minimal preemptive scheduling of independent jobs with release and due dates on open shop under resource constraints
- Complexity results for scheduling chains on a single machine
- On the complexity of scheduling jobs on dedicated resources to minimize set-up costs
- Scheduling multi-operational tasks on nonidentical machines as a time- optimal control problem
- Scheduling open shops with parallel machines
- On the complexity of generalized due date scheduling problems
- Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times
- Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis
- A new lower bound approach for single-machine multicriteria scheduling
- Open shop scheduling with machine dependent processing times
- Deadline scheduling of tasks with ready times and resource constraints
- Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
- Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
- The two-machine total completion time flow shop problem
- Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
- Task scheduling with and without communication delays: A unified approach
- The job shop scheduling problem: Conventional and new solution techniques
- Scheduling multiprocessor tasks -- An overview
- Scheduling multiprocessor tasks with chain constraints
- On the complexity of scheduling with large communication delays
- Single machine scheduling with batch deliveries
- Single machine scheduling subject to deadlines and resource dependent processing times
- Total completion time minimization in two-machine job shops with unit-time operations
- A two-machine preemptive openshop scheduling problem: An elementary proof of NP-completeness
- Minimizing average completion time in the presence of release dates
- Time lag size in multiple operations flow shop scheduling heuristics
- Multistage hybrid flowshop scheduling with identical jobs and uniform parallel machines
- Two-machine shop scheduling with zero and unit processing times
- Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness
- Scheduling in robotic cells: Complexity and steady state analysis
- Flowshop scheduling with identical jobs and uniform parallel machines
- Preemptive on-line scheduling for two uniform processors
- Complexity of single machine, multi-criteria scheduling problems
- A note on optimal assignment of slack due-dates in single-machine scheduling
- An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times
- The complexity of scheduling jobs in repetitive manufacturing systems
- Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function
- An approximation algorithm for a single-machine scheduling problem with release times and delivery times
- Tabu search for the job-shop scheduling problem with multi-purpose machines
- A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
- Scheduling unit time open shops to minimize the weighted number of late jobs
- Open shops with jobs overlap
- An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times
- A better lower bound for on-line scheduling
- Algorithmic characterizations of interval orderd hypergraphs and applications
- Scheduling jobs to minimize total cost
- Preemptive scheduling with release dates, delivery times and sequence independent setup times
- On-line load balancing
- On the complexity of preemptive openshop scheduling problems
This page was built for publication: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4198327)
