Pages that link to "Item:Q541691"
From MaRDI portal
The following pages link to Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan (Q541691):
Displayed 18 items.
- Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan (Q319276) (← links)
- Batch scheduling with deteriorating jobs to minimize the total completion time (Q384194) (← links)
- Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration (Q385474) (← links)
- Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine (Q506457) (← links)
- Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times (Q513627) (← links)
- Scheduling of deteriorating jobs with release dates to minimize the maximum lateness (Q690456) (← links)
- A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine (Q1653363) (← links)
- Single-machine serial-batching scheduling with a machine availability constraint, position-dependent processing time, and time-dependent set-up time (Q1679623) (← links)
- Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine (Q1694914) (← links)
- Parallel-batch scheduling with two models of deterioration to minimize the makespan (Q1724245) (← links)
- Complexity of scheduling with proportional deterioration and release dates (Q1787790) (← links)
- A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan (Q1991261) (← links)
- Single machine serial-batching scheduling with independent setup time and deteriorating job processing times (Q2257080) (← links)
- Deteriorating jobs scheduling on a single machine with release dates, rejection and a fixed non-availability interval (Q2346517) (← links)
- MAKESPAN MINIMIZATION ON THREE-MACHINE FLOW SHOP WITH DETERIORATING JOBS (Q2873830) (← links)
- SCHEDULING POSITION-BASED DETERIORATING JOBS WITH MULTIPLE RATE-MODIFYING ACTIVITIES AND PAST-SEQUENCE-DEPENDENT DELIVERY TIMES (Q2875636) (← links)
- Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes (Q5172586) (← links)
- A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines (Q5963694) (← links)