Pages that link to "Item:Q621032"
From MaRDI portal
The following pages link to Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration (Q621032):
Displayed 13 items.
- Single-machine scheduling with learning and forgetting effects (Q358103) (← links)
- Permutation flow shop scheduling with order acceptance and weighted tardiness (Q419558) (← links)
- The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect (Q422898) (← links)
- Single-machine group scheduling with general deterioration and learning effects (Q437886) (← links)
- Group scheduling with deteriorating jobs to minimize the total weighted number of late jobs (Q440780) (← links)
- Two-agent scheduling with position-based deteriorating jobs and learning effects (Q546060) (← links)
- Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties (Q548379) (← links)
- Single-machine due-window assignment problem with learning effect and deteriorating jobs (Q639174) (← links)
- Joint reply to the erratum and the note on ``Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning'' (Q646155) (← links)
- Some single-machine and flowshop scheduling problems with a non-linear deterioration function (Q660909) (← links)
- Two-machine flow shop total tardiness scheduling problem with deteriorating jobs (Q1930748) (← links)
- Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs (Q1955358) (← links)
- Single-machine scheduling with time-and-resource-dependent processing times (Q2428936) (← links)