scientific article; zbMATH DE number 3550182
From MaRDI portal
Publication:4124328
Cited in
(only showing first 100 items - show all)- A new hybrid genetic algorithm for job shop scheduling problem
- Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds
- Minimizing the stretch when scheduling flows of divisible requests
- Lower and upper bounds for the preemptive single machine scheduling problem with equal processing times
- Integrated scheduling of production and distribution with release dates and capacitated deliveries
- A prediction based iterative decomposition algorithm for scheduling large-scale job shops
- Bi-objective parallel machine scheduling with additional resources during setups
- Single-machine scheduling with an external resource
- Bottleneck machine identification method based on constraint transformation for job shop scheduling with genetic algorithm
- Approximation algorithms for some position-dependent scheduling problems
- Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
- A metric approach for scheduling problems with minimizing the maximum penalty
- Scheduling two jobs with fixed and nonfixed routes
- Objective-based counterfactual explanations for linear discrete optimization
- Exact approaches for single machine total weighted tardiness batch scheduling
- Exact algorithms for single-machine scheduling with time windows and precedence constraints
- Solving the traveling repairman problem on a line with general processing times and deadlines
- Effective on-line algorithms for reliable due date quotation and large-scale scheduling
- Optimal due date assignment in multi-machine scheduling environments
- A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times
- Asymptotic optimality of statistical multiplexing in pipelined processing
- A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
- Scheduling in a multi-processor environment with deteriorating job processing times and decreasing values: the case of forest fires
- New single machine and job-shop scheduling problems with availability constraints
- Grasp and delivery for moving objects on broken lines
- A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
- Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness
- Scheduling jobs with release and delivery times subject to nested eligibility constraints
- Scheduling unit processing time jobs on a single machine with multiple criteria
- A comprehensive review of flowshop group scheduling literature
- Metaheuristics for the single machine weighted quadratic tardiness scheduling problem
- Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times
- Optimizing termination decision for meta-heuristic search techniques that converge to a static objective-value distribution
- Optimal solutions for a dock assignment problem with trailer transportation
- Two-agent single-machine scheduling of jobs with time-dependent processing times and ready times
- Single-machine scheduling with no idle time and release dates to~minimize a regular criterion
- Notes on inverse bin-packing problems
- Scheduling jobs that arrive over time
- A best possible online algorithm for minimizing the total completion time and the total soft penalty cost
- Preemption in single machine earliness/tardiness scheduling
- Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling
- An assignment-based lower bound for a class of two-machine flow shop problems
- Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
- Novel formulations and logic-based Benders decomposition for the integrated parallel machine scheduling and location problem
- Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints
- Core instances for testing: a case study
- Combinations of some shop scheduling problems and the shortest path problem: complexity and approximation algorithms
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- Resource constraint scheduling with a fractional shared resource
- Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
- Some concepts of stability analysis in combinatorial optimization
- A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration
- Tabu search algorithms for minimizing total completion time on a single machine with an actual time-dependent learning effect
- Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times
- NP-hardness of shop-scheduling problems with three jobs
- A historical note on the complexity of scheduling problems
- Two-machine interval shop scheduling with time lags
- A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines
- Optimal control of a two-server flow-shop network
- The one-machine just-in-time scheduling problem with preemption
- Tower-of-sets analysis for the Kise-Ibaraki-Mine algorithm
- On the fine-grained parameterized complexity of partial scheduling to minimize the makespan
- Scheduling with limited machine availability
- Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties
- A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan
- An effective lower bound on \(L_{\max}\) in a worker-constrained job shop
- Single machine scheduling with nonlinear cost functions
- Scheduling to minimize total weighted completion time: performance guarantees of LP-based heuristics and lower bounds
- Stochastic Online Scheduling Revisited
- A variable neighborhood descent as ILS local search to the minimization of the total weighted tardiness on unrelated parallel machines and sequence dependent setup times
- A decomposition-based two-stage optimization algorithm for single machine scheduling problems with deteriorating jobs
- A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates
- A state-of-the-art survey on multi-scenario scheduling
- Loading and scheduling for flexible manufacturing systems with controllable processing times
- Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis
- Modeling single machine preemptive scheduling problems for computational efficiency
- A two-machine flowshop problem with two agents
- Approximation results in parallel machines stochastic scheduling
- On the complexity of two machine job-shop scheduling with regular objective functions
- Discrete-continuous project scheduling with discounted cash inflows and various payment models -- a review of recent results
- Inventory based bi-objective flow shop scheduling model and its hybrid genetic algorithm
- Preemptive scheduling of equal-length jobs in polynomial time
- Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates
- Mathematical model applied to single-track line scheduling problem in Brazilian railways
- Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning
- A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
- Genetic programming-based hyper-heuristic approach for solving dynamic job shop scheduling problem with extended technical precedence constraints
- An algorithm for single machine sequencing with release dates to minimize total weighted completion time
- Surrogate duality relaxation for job shop scheduling
- Instance space analysis and algorithm selection for the job shop scheduling problem
- Minimizing maximum tardiness and delivery costs with batch delivery and job release times
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
- Parallel machine problems with equal processing times: a survey
- Estimation of the absolute error and polynomial solvability for a classical NP-hard scheduling problem
- A review of open queueing network models of manufacturing systems
- A computational study of the permutation flow shop problem based on a tight lower bound
- Finding optimal tour schedules on transportation paths under extended time window constraints
- Bicriteria scheduling problem for unrelated parallel machines with release dates
- Acquisition planning and scheduling of computing resources
- A study on several combination problems of classic shop scheduling and shortest path
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4124328)
