Optimal Sequencing of a Single Machine Subject to Precedence Constraints
From MaRDI portal
Cited in
(only showing first 100 items - show all)- The counting complexity of a simple scheduling problem
- Single machine scheduling with release dates and rejection
- Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure
- Improved polynomial algorithms for robust bottleneck problems with interval data
- An \(O(n \log^ 2\,n)\) algorithm for the maximum weighted tardiness problem
- An algorithm for single machine sequencing with release dates to minimize maximum cost
- Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty
- k-optimal solution sets for some polynomially solvable scheduling problems
- Multiple and bicriteria scheduling: A literature survey
- Sequencing with general precedence constraints
- On the measurement of complexity in activity networks
- A bicriterion approach to time/cost trade-offs in sequencing
- On the complexity of generalized due date scheduling problems
- Applications of a semi-dynamic convex hull algorithm
- Four solution techniques for a general one machine scheduling problem. A comparative study
- Bicriterion scheduling of identical processing time jobs by uniform processors
- Scheduling inverse trees under the communication model of the LogP-machine
- A note on generalizing the maximum lateness criterion for scheduling
- An optimal scheduling algorithm for preemptable real-time tasks
- Integrated production and outbound distribution scheduling problems with job release dates and deadlines
- On the flexibility of a decision theory-based heuristic for single machine scheduling
- Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints
- Single machine scheduling with precedence constraints and positionally dependent processing times
- A possibilistic approach to sequencing problems with fuzzy parameters
- Single machine scheduling to minimize total weighted tardiness
- A note on Pareto minimizing total completion time and maximum cost
- Integrated scheduling of production and distribution with release dates and capacitated deliveries
- On two single machine scheduling problems with fuzzy processing times and fuzzy due dates
- Scheduling with fuzzy delays and fuzzy precedences.
- Single machine group scheduling with ordered criteria
- Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
- A constraint programming approach for a batch processing problem with non-identical job sizes
- The Pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine
- Minimizing functions of infeasibilities in a two-machine flow shop
- Single machine batch scheduling with two non-disjoint agents and splitable jobs
- Ideal schedules in parallel machine settings
- Single-machine scheduling with an external resource
- Minimizing total late work on a single machine with generalized due-dates
- Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion
- Single-machine scheduling with release times, deadlines, setup times, and rejection
- Unbounded serial-batching scheduling on hierarchical optimization
- Rescheduling problems with allowing for the unexpected new jobs arrival
- Single machine scheduling with rejection and generalized parameters
- Minimizing total weighted late work on a single-machine with non-availability intervals
- Sufficient conditions for the optimality of the greedy algorithm in greedoids
- Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties
- Minimizing makespan on a single machine with release dates and inventory constraints
- Minimizing maximum cost for a single machine under uncertainty of processing times
- Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices
- Finding efficient make-to-order production and batch delivery schedules
- A metric approach for scheduling problems with minimizing the maximum penalty
- Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints
- Risk-averse single machine scheduling: complexity and approximation
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- Bicriterion scheduling with group technology and deterioration effect
- Scheduling with release dates and preemption to minimize multiple max-form objective functions
- Logic-based Benders decomposition for scheduling a batching machine
- Single-machine time-dependent scheduling problems with fixed rate-modifying activities and resumable jobs
- Chance-constrained model for uncertain job shop scheduling problem
- Lawler's minmax cost problem under uncertainty
- Scheduling two agents on uniform parallel machines with~makespan and cost functions
- Maximum cost scheduling of jobs with mixed variable processing times and \(k\)-partite precedence constraints
- Approximations for the two-machine cross-docking flow shop problem
- Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- Stochastic scheduling to minimize expected maximum lateness
- The complexity of machine scheduling for stability with a single disrupted job
- Characterizations of polygreedoids and poly-antimatroids by greedy algorithms
- Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
- Scheduling in a contaminated area: a model and polynomial algorithms
- Approximability of scheduling problems with resource consuming jobs
- Scheduling orders for multiple product types with due date related objectives
- An algorithmic characterization of antimatroids
- An exact framework for the discrete parallel machine scheduling location problem
- Heuristic and exact algorithms for single-machine scheduling problems with general truncated learning effects
- Faster algorithms for bicriteria scheduling of identical jobs on uniform machines
- Single-machine bicriterion group scheduling with deteriorating setup times and job processing times
- Single machine scheduling problems with uncertain parameters and the OWA criterion
- Parallel-machine scheduling with release dates and rejection
- A primal-dual approximation algorithm for min-sum single-machine scheduling problems
- Lawler's minmax cost algorithm: optimality conditions and uncertainty
- Exact algorithms for single-machine scheduling with time windows and precedence constraints
- Single machine scheduling with two competing agents and equal job processing times
- Optimal restricted due date assignment in scheduling
- SOME GENERAL PROPERTIES OF A FUZZY SINGLE MACHINE SCHEDULING PROBLEM
- Single machine scheduling problem with two synergetic agents and piece-rate maintenance
- scientific article; zbMATH DE number 4035555 (Why is no real title available?)
- Single Machine General Maximum Cost Problem with Parallel-Chain Precedence Constraints
- A survey on offline scheduling with rejection
- A note on reverse scheduling with maximum lateness objective
- Time complexity of single machine scheduling with stochastic precedence constraints
- Optimal assignment of NOP due-dates and sequencing in a single machine shop
- Algorithms for single-machine scheduling with stochastic outtree precedence relations to minimize expected weighted flow time or maximum expected lateness
- Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
- A branch and bound algorithm for the minimum storage-time sequencing problem
- Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost
- Online single machine scheduling to minimize the maximum starting time
- Performance guarantees for a scheduling problem with common stepwise job payoffs
- A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop
This page was built for publication: Optimal Sequencing of a Single Machine Subject to Precedence Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5668250)