Single machine lot scheduling with maintenance activity
From MaRDI portal
Cites work
- A general scheme for solving a large set of scheduling problems with rejection in FPT time
- A greedy heuristic for solving scheduling problems with bounded rejection cost
- A note on a single-machine lot scheduling problem with indivisible orders
- A note on lot scheduling on a single machine to minimize maximum weighted tardiness
- A note on the single machine CON and CONW problems with lot scheduling
- A note to due-window assignment and single machine scheduling with deteriorating jobs and a rate-modifying activity
- A survey on offline scheduling with rejection
- Applying ``peeling onion approach for competitive analysis in online scheduling with rejection
- Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties
- Common due-window assignment for single-machine scheduling with generalized earliness/tardiness penalties and a rate-modifying activity
- Lot scheduling on a single machine
- Lot scheduling on a single machine to minimize the (weighted) number of tardy orders
- Machine scheduling with a rate-modifying activity
- Mathematical models and optimal algorithms for lot scheduling considering job splitting and due dates in green logistics
- Models and algorithms of time-dependent scheduling
- New results for scheduling to minimize tardiness on one machine with rejection and related problems
- Non-resumable scheduling on a single bounded parallel-batch machine with periodic maintenance
- On the minmax common-due-date problem: extensions to position-dependent processing times, job rejection, learning effect, uniform machines and flowshops
- Optimal sequence for single server scheduling incorporating a rate-modifying activity under job-dependent linear deterioration
- Polynomial time algorithms to find Pareto optimal schedules of bicriteria lot scheduling problems with splitable jobs on a single parallel-batch machine
- Scheduling with competing agents, total late work and job rejection
- Scheduling with time-changing effects and rate-modifying activities
- Single machine flow-time scheduling with a single breakdown
- Single machine flow-time scheduling with scheduled maintenance
- Single machine lot scheduling to minimize the total weighted (discounted) completion time
- Single machine lot scheduling with non-uniform lot capacities and processing times
- Single machine lot scheduling with optional job-rejection
- Single machine scheduling with non-availability interval and optional job rejection
- Single-machine lot scheduling with variable lot processing times
- Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration
- Single-machine scheduling with release times, deadlines, setup times, and rejection
- Two-machine flow shop and open shop scheduling problems with a single maintenance window
- Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection
- Unrelated parallel-machine scheduling problems with multiple rate-modifying activities
- Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time
This page was built for publication: Single machine lot scheduling with maintenance activity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6868573)
