Pages that link to "Item:Q1926950"

The following pages link to Simple matching vs linear assignment in scheduling models with positional effects: a critical review (Q1926950):

Displaying 19 items.

• Parallel-machine scheduling with maintenance: praising the assignment problem (Q322837) (← links)
• Scheduling a deteriorating maintenance activity and due-window assignment (Q337476) (← links)
• Scheduling with learning effects and/or time-dependent processing times to minimize the weighted number of tardy jobs on a single machine (Q474786) (← links)
• Resource constrained scheduling with general truncated job-dependent learning effect (Q511713) (← links)
• Single machine common flow allowance scheduling with deteriorating jobs and a rate-modifying activity (Q1634141) (← links)
• Single machine group scheduling with position dependent processing times and ready times (Q1664992) (← links)
• Single machine scheduling with a generalized job-dependent cumulative effect (Q1702657) (← links)
• Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration (Q2022187) (← links)
• A unified analysis for scheduling problems with variable processing times (Q2076372) (← links)
• Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection (Q2098030) (← links)
• Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects (Q2215199) (← links)
• Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine (Q2253532) (← links)
• On interactive sequencing situations with exponential cost functions (Q2272301) (← links)
• Single-machine scheduling problems with machine aging effect and an optional maintenance activity (Q2293744) (← links)
• Scheduling jobs and maintenance activities subject to job-dependent machine deteriorations (Q2398648) (← links)
• Single machine scheduling problems with general position-dependent processing times and past-sequence-dependent delivery times (Q2511457) (← links)
• An Optimal Online Algorithm for Scheduling with Learning Consideration (Q5024474) (← links)
• An FPTAS of minimizing total weighted completion time on single machine with position constraint (Q5136235) (← links)
• Due-Window Assignment for a Single Machine Scheduling with Both Deterioration and Positional Effects (Q5265454) (← links)