scientific article; zbMATH DE number 3471786
From MaRDI portal
Publication:4055377
Cited in
(only showing first 100 items - show all)- A population-based variable neighborhood search for the single machine total weighted tardiness problem
- Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates
- Interval-indexed formulation based heuristics for single machine total weighted tardiness problem
- Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect
- Single machine parallel-batch scheduling with deteriorating jobs
- The single-machine total tardiness scheduling problem: review and extensions
- Models for concurrent product and process design
- Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case
- An asymptotically exact polynomial algorithm for equipartition problems
- A compact labelling scheme for series-parallel graphs
- Average and worst-case analysis of heuristics for the maximum tardiness problem
- A block approach for single-machine scheduling with release dates and due dates
- Single machine scheduling to minimize weighted earliness subject to no tardy jobs
- A new integer programming formulation for the permutation flowshop problem
- An algorithm for single machine sequencing with release dates to minimize maximum cost
- A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
- Multiple and bicriteria scheduling: A literature survey
- A procedure for the one-machine sequencing problem with dependent jobs
- An adaptive branching rule for the permutation flow-shop problem
- Complexity results for scheduling chains on a single machine
- An algorithm for single machine sequencing with deadlines to minimize total weighted completion time
- On the complexity of generalized due date scheduling problems
- Single machine scheduling problem with a common deadline and resource dependent release dates
- The complexity of shop-scheduling problems with two or three jobs
- Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis
- Scheduling with release dates on a single machine to minimize total weighted completion time
- A guaranteed accuracy shifting bottleneck algorithm for the two-machine flowshop total tardiness problem
- Single machine earliness and tardiness scheduling
- Complexity of single machine, multi-criteria scheduling problems
- An approximation algorithm for a single-machine scheduling problem with release times and delivery times
- A note on generalizing the maximum lateness criterion for scheduling
- An optimal scheduling algorithm for preemptable real-time tasks
- A branch and bound algorithm for the job-shop scheduling problem
- An ordered independence system and its applications to scheduling problems
- Preemptive scheduling with release dates, delivery times and sequence independent setup times
- Adjustment of heads and tails for the job-shop problem
- Development of a heuristic project scheduler under resource constraints
- Complexity of scheduling multiprocessor tasks with prespecified processors allocations
- Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
- A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\)
- Heuristic procedures for minimizing makespan and the number of required pallets
- Is a unit-job shop not easier than identical parallel machines?
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
- Genetic algorithms to minimize the weighted number of late jobs on a single machine.
- An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time.
- A note on scheduling multiprocessor tasks with identical processing times.
- Scheduling unrelated parallel machines to minimize total weighted tardiness.
- Minimizing the weighted number of tardy jobs on a two-machine flow shop.
- Local search for multiprocessor scheduling: how many moves does it take to a local optimum?
- On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times.
- Open shop scheduling problems with late work criteria.
- A note on the maximum number of on-time jobs on parallel identical machines.
- A note on the SPT heuristic for solving scheduling problems with generalized due dates
- Parallel machine scheduling with a common server
- Scheduling equal-length jobs on identical parallel machines
- Nonpreemptive flowshop scheduling with machine dominance
- A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints
- Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
- Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem
- Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates
- Scheduling unrelated parallel machines with optional machines and jobs selection
- A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
- Single machine scheduling to minimize total weighted tardiness
- An exact approach to early/tardy scheduling with release dates
- Deterministic job-shop scheduling: Past, present and future
- Analysis of the twisting department at superior cable corporation: A case study
- Preemptive scheduling on identical parallel machines subject to deadlines.
- A class of on-line scheduling algorithms to minimize total completion time
- Using short-term memory to minimize the weighted number of late jobs on a single machine.
- Common due date assignment and scheduling with ready times
- Makespan estimation in batch process industries: A comparison between regression analysis and neural networks
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints
- A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times
- A heuristic approach for minimizing weighted tardiness and overtime costs in single resource scheduling
- Improved heuristics for the early/tardy scheduling problem with no idle time
- Makespan minimization for two parallel machines with an availability constraint
- A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation
- Scheduling shops to minimize the weighted number of late jobs
- Lot sizing in a no-wait flow shop
- The Pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine
- Complexity of mixed shop scheduling problems: A survey
- Minimizing functions of infeasibilities in a two-machine flow shop
- Decorous combinatorial lower bounds for row layout problems
- Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints
- The two-machine flow shop problem with arbitrary precedence relations
- K-PPM: a new exact method to solve multi-objective combinatorial optimization problems
- A survey of scheduling with controllable processing times
- A multi-objective optimization for preemptive identical parallel machines scheduling problem
- Scatter search for minimizing weighted tardiness in a single machine scheduling with setups
- Single machine unbounded parallel-batch scheduling with forbidden intervals
- Pareto optima for total weighted completion time and maximum lateness on a single machine
- Multi-family scheduling in a two-machine reentrant flow shop with setups
- Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups
- A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
- Stochastic scheduling to minimize expected maximum lateness
- The complexity of machine scheduling for stability with a single disrupted job
- Decentralized utilitarian mechanisms for scheduling games
- Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness
- Fast neighborhood search for the single machine total weighted tardiness problem
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 Q4055377)
