A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop
type: Item
instance of: scholarly article
title: A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop
zbMATH Open document ID: 1302.90081
author: Enrique Gerstl
author: Baruch Mor
author: Gur Mosheiov
published in: Information Processing Letters
publication date: 2014-12-09T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6378647
zbMATH Keywords: scheduling
zbMATH Keywords: proportionate flowshop
zbMATH Keywords: just-in-time
MaRDI profile type: Publication
full work available at URL: j.ipl.2014.09.004
OpenAlex ID: W1981229180
cites work: Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds
cites work: Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
cites work: The three-machine proportionate flow shop problem with unequal machine speeds
cites work: Single machine scheduling to minimize the number of early and tardy jobs
cites work: Optimal Sequencing of a Single Machine Subject to Precedence Constraints
cites work: An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
cites work: Review of the ordered and proportionate flow shop scheduling research
cites work: Scheduling
cites work: The Three-Machine No-Wait Flow Shop is NP-Complete
cites work: The just-in-time scheduling problem in a flow-shop scheduling system
cites work: Minimizing total weighted completion time in a proportionate flow shop
DOI: 10.1016/J.IPL.2014.09.004
Recommended article: Maximizing the weighted number of just-in-time jobs in flow shop scheduling
Recommended article: A note: maximizing the weighted number of just-in-time jobs for a given job sequence
Recommended article: Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system
Recommended article: Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times
Recommended article: Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems
Recommended article: An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem
Recommended article: A note: minimizing maximum earliness on a proportionate flowshop
Recommended article: Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
Recommended article: Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection
Recommended article: A note on study on proportionate flowshop scheduling with due-date assignment and position-dependent weights
description: scientific article; zbMATH DE number 6378647