scientific article; zbMATH DE number 3550182
From MaRDI portal
Publication:4124328
Cited in
(only showing first 100 items - show all)- A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations
- A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching
- Scheduling equal length jobs with eligibility restrictions
- Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
- Generalized order acceptance and scheduling problem with batch delivery: models and metaheuristics
- Speed scaling for maximum lateness
- Integrated production and distribution scheduling problems related with fixed delivery departure dates and number of late orders
- Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty
- Polynomially solvable subcases for the approximate solution of multi-machine scheduling problems
- Hybrid evolutionary algorithm with optimized operators for total weighted tardiness problem
- Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time
- On some lower bounds for the permutation flowshop problem
- A note on reverse scheduling with maximum lateness objective
- Single machine batch scheduling with release times and delivery costs
- An artificial bee colony algorithm for the job shop scheduling problem with random processing times
- Single machine total tardiness maximization problems: complexity and algorithms
- Optimality proof of the Kise-Ibaraki-Mine algorithm
- A local search algorithm for the flow shop scheduling problem with release dates
- Improved bounded dynamic programming algorithm for solving the blocking flow shop problem
- The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays
- 2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem
- Online production planning to maximize the number of on-time orders
- Minimizing value-at-risk in single-machine scheduling
- Computation of approximate -points for large scale single machine scheduling problem
- The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates
- Scheduling in supply chain environment
- Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds
- New bounds for single-machine time-dependent scheduling with uniform deterioration
- A new approximation algorithm for unrelated parallel machine scheduling with release dates
- A hybrid differential evolution and tree search algorithm for the job shop scheduling problem
- A PMBGA to optimize the selection of rules for job shop scheduling based on the Giffler-Thompson algorithm
- Optimal results and numerical simulations for flow shop scheduling problems
- Bounding the running time of algorithms for scheduling and packing problems
- Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervals
- Single machine scheduling with nonlinear lateness cost functions and fuzzy due dates
- Target-oriented robust satisficing models for the single machine scheduling problems with release time
- Parallel machine selection and job scheduling to minimize machine cost and job tardiness
- ON ONLINE SCHEDULING JOBS WITH RESTART TO MAXIMIZE THE NUMBER OF JOBS COMPLETED TIME ON A SINGLE MACHINE
- Scheduling a single machine with primary and secondary objectives
- A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process
- Matching supply and demand in a sharing economy: classification, computational complexity, and application
- Bicriteria multi-machine scheduling with equal processing times subject to release dates
- An efficient ILP formulation for the single machine scheduling problem
- On the complexity of scheduling problems with a fixed number of parallel identical machines
- On a scheduling problem where a job can be executed only by a limited number of processors
- Minimizing average completion time in the presence of release dates
- Yard crane scheduling in port container terminals
- Two-machine flowshop scheduling in a physical examination center
- Combining constraint programming and temporal decomposition approaches -- scheduling of an industrial formulation plant
- Performance guarantees of local search for minsum scheduling problems
- Single-machine primary-secondary scheduling with total tardiness being the primary criterion
- Two very large-scale neighborhoods for single machine scheduling
- Complexity of single machine scheduling subject to nonnegative inventory constraints
- Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices
- Single machine scheduling with release dates: a distributionally robust approach
- Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty
- A graph coloring approach to the deployment scheduling and unit assignment problem
- On the exact solution of a large class of parallel machine scheduling problems
- Total completion time minimization on multiple machines subject to machine availability and makespan constraints
- Using genetic algorithms for single-machine bicriteria scheduling problems
- Robust single machine makespan scheduling with release date uncertainty
- Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
- Scheduling bidirectional traffic on a path
- New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
- Scheduling with variable-length calibrations: two agreeable variants
- Scheduling Algorithms for Single Machine Problem with Release and Delivery Times
- Scheduling of a single machine to minimize total weighted completion time subject to release dates
- Metaheuristics for order scheduling problem with unequal ready times
- A controlled search simulated annealing method for the single machine weighted tardiness problem
- Minimizing the sum of weighted completion times with unrestricted weights
- A sequencing problem with family setup times
- Server cloud scheduling
- Parameterized complexity of machine scheduling: 15 open problems
- A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile
- Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints
- An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem
- A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times
- Minimizing delays in a shunting yard
- A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints
- A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time
- Scheduling algorithms based on necessary optimality conditions
- Structural scheduling in the problems of scheduling theory
- Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times
- Analysis of the similarities and differences of job-based scheduling problems
- Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem
- Order assignment and scheduling under processing and distribution time uncertainty
- The constrained parallel-machine scheduling problem with divisible processing times and penalties
- The coordination of scheduling and batch deliveries
- Performance of the LPT algorithm in multiprocessor scheduling
- General approximation algorithms for some arithmetical combinatorial problems
- An efficient algorithm for a job shop problem
- A time indexed formulation of non-preemptive single machine scheduling problems
- Integrated production and outbound distribution scheduling problems with job release dates and deadlines
- Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties
- Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances
- A decomposition scheme for single stage scheduling problems
- scientific article; zbMATH DE number 1271322 (Why is no real title available?)
- Application of the interpolation approach for approximating single-machine scheduling problem with an unknown objective function
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
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)
