scientific article; zbMATH DE number 3550182
From MaRDI portal
Publication:4124328
Cited in
(only showing first 100 items - show all)- The one-machine just-in-time scheduling problem with preemption
- An empirical analysis of the optimality rate of flow shop heuristics
- Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness
- Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates
- Some no-wait shops scheduling problems: Complexity aspect
- On a scheduling problem where a job can be executed only by a limited number of processors
- The two-machine flowshop scheduling problem with total tardiness
- Scheduling algorithms based on necessary optimality conditions
- Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty
- A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile
- General approximation algorithms for some arithmetical combinatorial problems
- An algorithm for single machine sequencing with release dates to minimize total weighted completion time
- Surrogate duality relaxation for job shop scheduling
- A time indexed formulation of non-preemptive single machine scheduling problems
- Task scheduling with interprocessor communication delays
- A review of open queueing network models of manufacturing systems
- A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
- The job shop scheduling problem: Conventional and new solution techniques
- Approximability of flow shop scheduling
- Minimizing average completion time in the presence of release dates
- An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups
- Scheduling two jobs with fixed and nonfixed routes
- A look-ahead heuristic for scheduling jobs with release dates on a single machine
- Scheduling parallel machines to minimize total weighted and unweighted tardiness
- On the complexity of two machine job-shop scheduling with regular objective functions
- Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
- Decomposition methods for large job shops
- A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
- Integrated production and outbound distribution scheduling problems with job release dates and deadlines
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
- Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times
- A comprehensive review of flowshop group scheduling literature
- Metaheuristics for the single machine weighted quadratic tardiness scheduling problem
- Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times
- Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times
- Algorithms for the unrelated parallel machine scheduling problem with a resource constraint
- A decomposition-based two-stage optimization algorithm for single machine scheduling problems with deteriorating jobs
- A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs
- Estimation of the absolute error and polynomial solvability for a classical NP-hard scheduling problem
- A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem
- 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
- Metaheuristics for order scheduling problem with unequal ready times
- Two-machine flowshop scheduling in a physical examination center
- A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints
- A new hybrid genetic algorithm for job shop scheduling problem
- An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times
- An exact approach for scheduling jobs with regular step cost functions on a single machine
- A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
- No-wait or no-idle permutation flowshop scheduling with dominating machines
- A computational study of the permutation flow shop problem based on a tight lower bound
- Core instances for testing: a case study
- Parameterized complexity of machine scheduling: 15 open problems
- 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
- Integrated scheduling of production and distribution with release dates and capacitated deliveries
- Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints
- Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds
- Lower bounds for the job-shop scheduling problem on multi-purpose machines
- Some concepts of stability analysis in combinatorial optimization
- Scheduling unit processing time jobs on a single machine with multiple criteria
- Structural scheduling in the problems of scheduling theory
- Using genetic algorithms for single-machine bicriteria scheduling problems
- Approximation schemes for parallel machine scheduling problems with controllable processing times
- NP-hardness of shop-scheduling problems with three jobs
- An efficient algorithm for a job shop problem
- Minimizing the sum of weighted completion times with unrestricted weights
- Asymptotic optimality of statistical multiplexing in pipelined processing
- On a scheduling problem in a robotized analytical system
- A sequencing problem with family setup times
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
- Scheduling in a multi-processor environment with deteriorating job processing times and decreasing values: the case of forest fires
- Scheduling with limited machine availability
- Matching supply and demand in a sharing economy: classification, computational complexity, and application
- Minimizing delays in a shunting yard
- Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags
- Single-machine scheduling with an external resource
- Bi-objective parallel machine scheduling with additional resources during setups
- Scheduling jobs with release and delivery times subject to nested eligibility constraints
- Makespan minimization with OR-precedence constraints
- Disruption recovery at airports: ground holding, curfew restrictions and an approximation algorithm
- Scheduling periodic I/O access with bi-colored chains: models and algorithms
- Metric interpolation for the problem of minimizing the maximum lateness for a single machine
- A 2-competitive largest job on least loaded machine online algorithm based on the multi list scheduling model
- Randomized selection algorithm for online stochastic unrelated machines scheduling
- Order assignment and scheduling under processing and distribution time uncertainty
- Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time
- 2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem
- Combining constraint programming and temporal decomposition approaches -- scheduling of an industrial formulation plant
- Performance guarantees of local search for minsum scheduling problems
- Optimizing termination decision for meta-heuristic search techniques that converge to a static objective-value distribution
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- On the fine-grained parameterized complexity of partial scheduling to minimize the makespan
- Coordinated optimization of production scheduling and maintenance activities with machine reliability deterioration
- The quality of equilibria for set packing and throughput scheduling games
- A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time
- An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown
- Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices
- Scheduling personnel for the build-up of unit load devices at an air cargo terminal with limited space
- Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network
- On the exact solution of a large class of parallel machine scheduling problems
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)
