scientific article; zbMATH DE number 5345853
From MaRDI portal
Publication:3525910
Cited in
(only showing first 100 items - show all)- Minmax scheduling problems with a common due-window
- Learning heuristics for basic block instruction scheduling
- A genetic algorithm for the proportionate multiprocessor open shop
- Solution approaches for the soft drink integrated production lot sizing and scheduling problem
- A new heuristic algorithm for the machine scheduling problem with job delivery coordination
- Exponential inapproximability and FPTAS for scheduling with availability constraints
- Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness
- Heuristics and exact methods for number partitioning
- A tabu search algorithm for scheduling pharmaceutical packaging operations
- On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls
- Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants
- Scheduling jobs under decreasing linear deterioration
- A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times
- Scheduling of design projects with uncertain number of iterations
- The job shop scheduling problem: Conventional and new solution techniques
- Batch scheduling with deadlines on parallel machines
- Lot sizing and scheduling -- survey and extensions
- The complexity of multidimensional periodic scheduling
- A three-dimensional matching model for perishable production scheduling
- Impact of learning and fatigue factors on single machine scheduling with penalties for tardy jobs
- On stochastic machine scheduling with general distributional assumptions
- Two-machine flowshop scheduling with availability constraints
- Benchmarks for shop scheduling problems
- Heuristics for the flow line problem with setup costs
- Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism
- Multi-period job selection: Planning work loads to maximize profit
- Using information about machine failures to control flowlines
- Stability of a schedule minimizing mean flow time
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- Look ahead job demanding for improving job shop performance
- Optimal makespan scheduling with given bounds of processing times
- A heuristic algorithm for mean flowtime objective in flowshop scheduling
- The lazy bureaucrat scheduling problem
- Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times.
- Resource-constrained project scheduling: A survey of recent developments.
- Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
- Using global search heuristics for the capacity vehicle routing problem.
- A concise survey of scheduling with time-dependent processing times
- A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage.
- A contribution to the stochastic flow shop scheduling problem.
- QoS guided min-min heuristic for grid task scheduling
- Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints.
- Complexity and approximation results for scheduling multiprocessor tasks on a ring.
- Minimizing the makespan for the flow shop scheduling problem with availability constraints.
- An efficient tabu search approach for the two-machine preemptive open shop scheduling problem.
- A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines.
- Parallel machine scheduling of machine-dependent jobs with unit-length.
- Improved genetic algorithm for the permutation flowshop scheduling problem.
- An ant colony system for permutation flow-shop sequencing
- A hybrid genetic algorithm for the open shop scheduling problem
- A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups
- On three-machine flow shops with random job processing times
- Efficiency of reductions of job-shop to flow-shop problems
- Minmax regret solutions for minimax optimization problems with uncertainty
- Machine scheduling with a rate-modifying activity
- An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns
- Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure
- Dynamic scheduling of stochastic jobs on a single machine
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Scheduling one-part-type serial manufacturing system under periodic demand: A solvable case
- Extending Graham's result on scheduling to other heuristics
- Planning the project management way: Efficient planning by effective integration of causal and resource reasoning in RealPlan
- The convergence of stochastic algorithms solving flow shop scheduling
- Tabu search for resource-constrained scheduling
- A comparative study of dispatching rules in dynamic flowshops and jobshops
- Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints
- Minimizing the expected number of tardy jobs when processing times are normally distributed
- Single machine scheduling with assignable due dates
- Empirical analysis of algorithms for the shortest negative cost cycle problem
- Multiobjective order acceptance and scheduling on unrelated parallel machines with machine eligibility constraints
- Online scheduling of two job types on a set of multipurpose machines with unit processing times
- An ant colony optimization algorithm for load balancing in parallel machines with sequence-dependent setup times
- Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- A hybrid framework for over-constrained generalized resource-constrained project scheduling problems
- A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem
- Enhancing router QoS through job scheduling with weighted shortest processing time-adjusted
- Sequencing the processing of incoming mail to match an outbound truck delivery schedule
- A computational study of the permutation flow shop problem based on a tight lower bound
- Two simulated annealing-based heuristics for the job shop scheduling problem
- Scheduling of industrial distribution manifolds with pre-conditions
- An iterative improvement approach for the nonpreemptive open shop scheduling problem
- Stochastically minimizing the makespan in two-machine flow shops without blocking
- Analysis of the twisting department at superior cable corporation: A case study
- The three-machine proportionate flow shop problem with unequal machine speeds
- Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound
- Single machine earliness-tardiness scheduling with resource-dependent release dates
- Review of properties of different precedence graphs for scheduling problems
- Job-shop scheduling with blocking and no-wait constraints
- Development and analysis of cost-based dispatching rules for job shop scheduling
- Parallel machine scheduling under a grade of service provision
- Minimizing total weighted tardiness on a single batch process machine with incompatible job families
- Scheduling two-machine preemptive open shops to minimize total completion time
- Total completion time minimization in a computer system with a server and two parallel processors
- Flow-shop scheduling for three serial stations with the last two duplicate
- A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem
- The simple F2//C with forbidden tasks in first or last position: a problem more complex that it seems
- Resolution of a scheduling problem in a flowshop robotic cell
- Markovian analysis for performance evaluation and scheduling in m machine stochastic flow-shop with buffers of any capacity
- A note on flow-shop and job-shop batch scheduling with identical processing-time jobs
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 Q3525910)
