scientific article; zbMATH DE number 3425355
From MaRDI portal
Publication:3212909
Cited in
(40)- Algorithms for single machine total tardiness scheduling with sequence dependent setups
- A flexible flowshop problem with total flow time minimization
- Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness
- Assignment of a job load in a distributed system: A multicriteria design method
- Online scheduling of ordered flow shops
- Modeling and Active Learning for Experiments with Quantitative-Sequence Factors
- Four solution techniques for a general one machine scheduling problem. A comparative study
- Theoretical aspects of multicriteria flight gate scheduling: Deterministic and fuzzy models
- Characterizing the set of feasible sequences for n jobs to be carried out on a single machine
- Scatter search for minimizing weighted tardiness in a single machine scheduling with setups
- Job oriented production scheduling
- Complexity of two dual criteria scheduling problems
- Complexity of single machine, multi-criteria scheduling problems
- Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry
- Scheduling unit processing time jobs on a single machine with multiple criteria
- The proportionate two-machine no-wait job shop scheduling problem
- Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem
- An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
- A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times
- Minmax scheduling and due-window assignment with position-dependent processing times and job rejection
- A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness
- A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness
- NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
- Single machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programming
- Single-machine scheduling with learning considerations
- Processing time generation schemes for parallel machine scheduling problems with various correlation structures
- Solving a bicriterion scheduling problem
- A bicriteria approach to the two-machine flow shop scheduling problem
- An efficient heuristic approach to the scheduling of jobs in a flowshop
- Grouping products for the optimization of production processes: a case in the steel manufacturing industry
- Scheduling in a sequence dependent setup environment with genetic search
- Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop
- The significance of reducing setup times/setup costs
- Parallel machine makespan minimization subject to machine availability and total completion time constraints
- Flowshop scheduling with dominant machines
- Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach
- Proportionate flowshops with general position-dependent processing times
- Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups
- A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing
- Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness
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 Q3212909)
