Pages that link to "Item:Q5959375"

The following pages link to Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs (Q5959375):

Displaying 24 items.

• Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times (Q398882) (← links)
• The just-in-time scheduling problem in a flow-shop scheduling system (Q421784) (← links)
• Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines (Q600836) (← links)
• Maximizing the weighted number of just-in-time jobs in flow shop scheduling (Q835569) (← links)
• Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
• Maximizing weighted number of just-in-time jobs on unrelated parallel machines (Q880513) (← links)
• Just-in-time scheduling with controllable processing times on parallel machines (Q975765) (← links)
• A just-in-time scheduling problem with two competing agents (Q2228372) (← links)
• Two-agent single-machine scheduling problem with just-in-time jobs (Q2250441) (← links)
• Models and algorithms for energy-efficient scheduling with immediate start of jobs (Q2317131) (← links)
• Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
• Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach (Q2370333) (← links)
• A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines (Q2387307) (← links)
• Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs (Q2400041) (← links)
• A multi-objective optimization for preemptive identical parallel machines scheduling problem (Q2403115) (← links)
• Earliness--tardiness production planning for just-in-time manufacturing: a unifying approach by goal programming (Q2432869) (← links)
• Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems (Q2434268) (← links)
• A survey of scheduling problems with setup times or costs (Q2467249) (← links)
• Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey (Q2958665) (← links)
• Parallel flowshop scheduling using Tabu search (Q4474674) (← links)
• Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs (Q5058931) (← links)
• Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection (Q6103749) (← links)
• A note: maximizing the weighted number of just-in-time jobs for a given job sequence (Q6136084) (← links)
• Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques (Q6196891) (← links)