Pages that link to "Item:Q1342341"
From MaRDI portal
The following pages link to Flowshop scheduling with dominant machines (Q1342341):
Displayed 33 items.
- Solution algorithms for synchronous flow shop problems with two dominating machines (Q342451) (← links)
- Flowshop scheduling problems with a position-dependent exponential learning effect (Q474618) (← links)
- Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration (Q621032) (← links)
- Makespan minimization in machine dominated flowshop (Q708144) (← links)
- Complexity results for flow shop problems with synchronous movement (Q726218) (← links)
- Permutation flowshop manufacturing cell scheduling problems with deteriorating jobs and sequence dependent setup times under dominant machines (Q828672) (← links)
- Minimizing total completion time in a two-machine flow shop with deteriorating jobs (Q850246) (← links)
- Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time (Q861201) (← links)
- Flow shop scheduling problems with decreasing linear deterioration under dominant machines (Q868141) (← links)
- A note on flow shop scheduling problems with a learning effect on no-idle dominant machines (Q879575) (← links)
- An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems (Q1010274) (← links)
- Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times (Q1025256) (← links)
- RTSS: An interactive decision support system for solving real time scheduling problems considering customer and job priorities with schedule interruptions. (Q1406711) (← links)
- Minimizing the weighted number of tardy jobs on a two-machine flow shop. (Q1413849) (← links)
- Non-bottleneck machines in three-machine flow shops (Q1585915) (← links)
- Nonpreemptive flowshop scheduling with machine dominance (Q1604067) (← links)
- Reduction of permutation flowshop problems to single machine problems using machine dominance relations (Q1652025) (← links)
- A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs (Q1667779) (← links)
- No-wait or no-idle permutation flowshop scheduling with dominating machines (Q1767400) (← links)
- Two-machine flowshop scheduling with job class setups to minimize total flowtime (Q1781550) (← links)
- Some scheduling problems with time-dependent learning effect and deteriorating jobs (Q1791453) (← links)
- Minimizing tardy jobs in a flowshop with common due date (Q1969838) (← links)
- A two-machine no-wait flow shop problem with two competing agents (Q2075466) (← links)
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
- Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
- Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines (Q2370335) (← links)
- Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs (Q2514766) (← links)
- Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling (Q2664303) (← links)
- SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING (Q3439889) (← links)
- Sensitivity analysis for some scheduling problems (Q3538478) (← links)
- Scheduling deteriorating jobs with rejection on dominant machines (Q3640924) (← links)
- Minimizing Mean Completion Time for Special Flowshop Problems (Q4341060) (← links)
- A note on scheduling problems with learning effect and deteriorating jobs (Q5426620) (← links)